devbox
weixin_40725706
这个屌丝很懒，什么也没留下！
关注作者
热门标签
热门文章
当前位置:   article > 正文

操作系统 实验29 同步与互斥

作者：weixin_40725706 | 2024-06-06 21:15:24

赞

踩

操作系统 实验29 同步与互斥

1、并发线程同步与互斥

源程序：

  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <pthread.h>
  4. #include <unistd.h>
  5. #include <string.h>
  6. int num=30,count=10;
  7. pthread_mutex_t mylock=PTHREAD_MUTEX_INITIALIZER; 
  8. void *sub1(void *arg) {
  9.     int i = 0,tmp;
  10.     for (; i <count; i++)
  11.     {
  12. 		pthread_mutex_lock(&mylock);    			tmp=num-1;
  13. 	 	usleep(13);
  14.         	num=tmp;								pthread_mutex_unlock(&mylock);	        		printf("线程1 num减1后值为: %d\n",num);
  15.     }
  16. 	return ((void *)0);
  17. }
  18. void *sub2(void *arg){
  19.     int i=0,tmp;
  20.     for(;i<count;i++)
  21.     {
  22. 		pthread_mutex_lock(&mylock);
  23.         	tmp=num-1;
  24. 	 	usleep(31);
  25.         	num=tmp;
  26. 	 	pthread_mutex_unlock(&mylock);
  27.         	printf("线程2 num减1后值为: %d\n",num);
  28.     }
  29.     return ((void *)0);
  30. }
  31. int main(int argc, char** argv) {
  32.     pthread_t tid1,tid2;
  33.     int err,i=0,tmp;
  34.     void *tret;
  35.     err=pthread_create(&tid1,NULL,sub1,NULL);
  36.     if(err!=0)
  37.     {
  38.     	printf("pthread_create error:%s\n",strerror(err));
  39.         exit(-1);
  40.     }
  41. err=pthread_create(&tid2,NULL,sub2,NULL);
  42.     if(err!=0)
  43.     {
  44.     	printf("pthread_create error:%s\n",strerror(err));
  45.         exit(-1);
  46.     }
  47.  for(;i<count;i++)
  48.     {
  49. 		pthread_mutex_lock(&mylock);     			tmp=num-1;
  50. 		usleep(5);	
  51.      		num=tmp;		
  52. 	 	pthread_mutex_unlock(&mylock); 
  53.         	printf("main num减1后值为: %d\n",num);
  54.     }
  55.     printf("两个线程运行结束\n");
  56.     err=pthread_join(tid1,&tret);
  57. if(err!=0)
  58.     {
  59.     	printf("can not join with thread1:%s\n",strerror(err));
  60.         exit(-1);
  61.     }
  62.     printf("thread 1 exit code %d\n",(int)tret);
  63.  err=pthread_join(tid2,&tret);
  64.     if(err!=0)
  65.     {
  66.     	printf("can not join with thread1:%s\n",strerror(err));
  67.         exit(-1);
  68.     }
  69.     printf("thread 2 exit code %d\n",(int)tret);
  70.     return 0;
  71. }

编译链接命令：gcc threadmutex.c -o threadmutex -lpthread

运行命令：./threadmutex

交互与结果：

2、生产者-消费者同步与互斥试验

源程序：

  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <sys/types.h>
  4. #include <pthread.h>
  5. #include <unistd.h>
  6. #include <signal.h>
  7. #include <semaphore.h>
  8. #define Maxbuf 10		//缓冲单元数目
  9. #define TimesOfOp 10		//生产者、消费者循环读写缓冲区的次数
  10. #define true 1
  11. #define false 0
  12. #define historynum 100	//生产者、消费者读写历史记录数目
  13. struct Circlebuf	//循环缓冲队列结构
  14. {
  15. 	int read; 			//读指针
  16. 	int write; 		//写指针
  17. 	int buf[Maxbuf]; 	//缓冲区
  18. } circlebuf;
  19. sem_t mutex;			//互斥信号量
  20. sem_t empty; 			//空白缓冲区同步信号量
  21. sem_t full; 			//满缓冲区同步信号量
  22. char writehistory[historynum][30];//写历史
  23. char readhistory[historynum][30];//读历史
  24. int writehistorycount=0;		//写历史计数器
  25. int readhistorycount=0; 		//读历史计数器
  26. char history[historynum][30];	//缓冲区操作历史
  27. int historycount=0;		//缓冲区操作历史计数器
  28. void writeCirclebuf(struct Circlebuf *circlebuf,int *value) //向缓冲区中写一个值
  29. {
  30. 	circlebuf->buf[circlebuf->write]=(*value);
  31. 	sleep(1);							
  32. 	circlebuf->write=(circlebuf->write+1)%Maxbuf; 
  33. }
  34. int readCirclebuf(struct Circlebuf *circlebuf)
  35. {
  36. 	int value=0;
  37. 	value=circlebuf->buf[circlebuf->read];		sleep(1);								circlebuf->buf[circlebuf->read]=0; 			circlebuf->read=(circlebuf->read+1)%Maxbuf; 	return value;
  38. }
  39. void sigend(int sig)
  40. {
  41. 	exit(0);
  42. }
  43. void * productThread(void *i)
  44. {
  45. 	int *n=(int *)i;
  46. 	int t=TimesOfOp;
  47. 	int writeptr;
  48.  
  49. 	while(t--)
  50. 	{	sem_wait(&empty);
  51. 		sem_wait(&mutex);
  52. 		writeCirclebuf(&circlebuf,n);
  53. 		if(circlebuf.write>0) writeptr=circlebuf.write-1;
  54. 		else writeptr= Maxbuf-1;
  55. 	sprintf(writehistory[writehistorycount++],"生产者%d:缓冲区%d=%d", *n,writeptr,*n);
  56. 		sprintf(history[historycount++],"生产者%d:缓冲区%d=%d\n", *n,writeptr, *n);
  57. 		sem_post(&mutex);
  58. 		sem_post(&full);
  59. 		sleep(1);
  60. 	}
  61. }
  62. void * consumerThread(void *i)
  63. {
  64. 	int *n=(int *)i;
  65. 	int t=TimesOfOp;						int value=0;							int readptr;							while(t--)
  66. 	{
  67. 		sem_wait(&full);						sem_wait(&mutex);
  68. 		value=readCirclebuf(&circlebuf);			if(circlebuf.read>0) readptr=circlebuf.read-1;	
  69. 		else readptr= Maxbuf-1;
  70. 		sprintf(readhistory[readhistorycount++], "消费者%d:缓冲区%d=%d\n", *n,readptr,value);
  71. 		sprintf(history[historycount++],"消费者%d:缓冲区%d=%d\n", *n,readptr,value);
  72. 		sem_post(&mutex);						sem_post(&empty);						sleep(1);							}
  73. }
  74. int main()
  75. {
  76. 	int i,max;
  77. 	int ConsNum=0,ProdNum=0,ret;
  78. 	sem_init(&mutex,0,1);
  79. 	sem_init(&empty,0,Maxbuf);
  80. 	sem_init(&full,0,0);	
  81. 	signal(SIGINT, sigend);
  82. 	signal(SIGTERM, sigend);
  83. 	circlebuf.read=circlebuf.write=0;
  84. 	for(i=0;i<Maxbuf;i++)
  85. 		circlebuf.buf[i]=0;
  86. 	printf("请输入生产者线程的数目 :");
  87. 	scanf("%d",&ProdNum);
  88. 	int *pro=(int*)malloc(ProdNum*sizeof(int));
  89. 	pthread_t *proid=(pthread_t*)malloc(ProdNum*sizeof(pthread_t));
  90.   	printf("请输入消费者线程的数目 :");
  91.  	scanf("%d",&ConsNum);
  92. 	int *con=(int*)malloc(ConsNum*sizeof(int));
  93. 	pthread_t *conid=(pthread_t*)malloc(ConsNum*sizeof(pthread_t));
  94. 	for(i=1;i<=ConsNum;i++)
  95. 	{
  96. 		con[i-1]=i;
  97. 	ret=pthread_create(&conid[i],NULL,consumerThread,(void *)&con[i-1]);
  98. 		if(ret!=0)
  99. 		{
  100. 			printf("Create thread error");
  101. 			exit(1);
  102. 		}
  103. 	}
  104. 	for(i=1;i<=ProdNum;i++)
  105. 	{
  106. 		pro[i-1]=i;
  107. 	ret=pthread_create(&proid[i],NULL,productThread,(void *)&pro[i-1]);
  108. 		if(ret!=0)
  109. 		{
  110. 			printf("Create thread error");
  111. 			exit(1);
  112. 		}
  113. 	}
  114. 	sleep((ConsNum+ ProdNum)*10);
  115. 	if (writehistorycount>readhistorycount) max=writehistorycount;
  116. 	else max=readhistorycount;
  117. 	
  118. 	for(i=0;i<max;i++)
  119. 		if ((i<writehistorycount) && (i<readhistorycount))
  120. 			printf("%s | %s\n",writehistory[i],readhistory[i]);
  121. 		else if (i<writehistorycount)
  122. 			printf("%s | %s\n",writehistory[i]," ");
  123. 		else 	printf("%s | %s\n"," ",readhistory[i]);
  124. 	printf("*************缓冲池的操作历史为：******************\n");
  125. 	for(i=0;i<historycount;i++)  printf("%s",history[i]);
  126. 	sem_destroy(&mutex);	
  127. 	sem_destroy(&empty);
  128. 	sem_destroy(&full);
  129. }

编译链接命令：gcc pc1.c -o pc1 -lpthread

运行命令：./pc1

交互与结果：

3、生产者-消费者未加同步与互斥机制的运行试验

源程序：

  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <sys/types.h>
  4. #include <pthread.h>
  5. #include <unistd.h>
  6. #include <signal.h>
  7. #define Maxbuf 10       //缓冲单元数目
  8. #define TimesOfOp 10    //生产者、消费者循环读写缓冲区的次数
  9. #define true 1
  10. #define false 0
  11. #define historynum 100  //生产者、消费者读写历史记录数目
  12. struct Circlebuf    //循环缓冲队列结构
  13. {
  14.     int read;            //读指针
  15.     int write;       //写指针
  16.     int buf[Maxbuf];    //缓冲区
  17. } circlebuf;
  18.  
  19. char writehistory[historynum][30];//写历史
  20. char readhistory[historynum][30];//读历史
  21. int writehistorycount=0;        //写历史计数器
  22. int readhistorycount=0;         //读历史计数器
  23. char history[historynum][30];    //缓冲区操作历史
  24. int historycount=0;        //缓冲区操作历史计数器
  25.  
  26. void writeCirclebuf(struct Circlebuf *circlebuf,int *value) //向缓冲区中写一个值
  27. {
  28.     circlebuf->buf[circlebuf->write]=(*value);
  29.     sleep(1);                           
  30.     circlebuf->write=(circlebuf->write+1)%Maxbuf; 
  31. }
  32. int readCirclebuf(struct Circlebuf *circlebuf)
  33. {
  34.     int value=0;
  35.     value=circlebuf->buf[circlebuf->read];        sleep(1);                                
  36.     circlebuf->buf[circlebuf->read]=0;            circlebuf->read=(circlebuf->read+1)%Maxbuf;     return value;
  37. }
  38.  
  39. void sigend(int sig)
  40. {
  41.     exit(0);
  42. }
  43.  
  44. void * productThread(void *i)
  45. {
  46.     int *n=(int *)i;
  47.     int t=TimesOfOp;
  48.     int writeptr;
  49.     while(t--)
  50.     {   
  51.         writeCirclebuf(&circlebuf,n);
  52.         if(circlebuf.write>0) writeptr=circlebuf.write-1;
  53.         else writeptr= Maxbuf-1;
  54.     sprintf(writehistory[writehistorycount++],"生产者%d:缓冲区%d=%d", *n,writeptr,*n);
  55.         sprintf(history[historycount++],"生产者%d:缓冲区%d=%d\n", *n,writeptr, *n);
  56.         sleep(1);
  57.     }
  58. }
  59.  
  60. void * consumerThread(void *i)
  61. {
  62.     int *n=(int *)i;
  63.     int t=TimesOfOp;                        int value=0;                            int readptr;                            while(t--)
  64.     {
  65.         value=readCirclebuf(&circlebuf);            if(circlebuf.read>0) readptr=circlebuf.read-1;    
  66.         else readptr= Maxbuf-1;
  67.         sprintf(readhistory[readhistorycount++], "消费者%d:缓冲区%d=%d\n", *n,readptr,value);
  68.         sprintf(history[historycount++],"消费者%d:缓冲区%d=%d\n", *n,readptr,value);
  69.         sleep(1);
  70.     }
  71. }
  72.  
  73. int main()
  74. {
  75.     int i,max;
  76.     int ConsNum=0,ProdNum=0,ret;
  77.     circlebuf.read=circlebuf.write=0;
  78.     for(i=0;i<Maxbuf;i++)
  79.         circlebuf.buf[i]=0;
  80.     printf("请输入生产者线程的数目 :");
  81.     scanf("%d",&ProdNum);
  82.     int *pro=(int*)malloc(ProdNum*sizeof(int));
  83.     pthread_t *proid=(pthread_t*)malloc(ProdNum*sizeof(pthread_t));
  84.     printf("请输入消费者线程的数目 :");
  85.     scanf("%d",&ConsNum);
  86.     int *con=(int*)malloc(ConsNum*sizeof(int));
  87.     pthread_t *conid=(pthread_t*)malloc(ConsNum*sizeof(pthread_t));
  88.     for(i=1;i<=ConsNum;i++)
  89.     {
  90.         con[i-1]=i;
  91.     ret=pthread_create(&conid[i],NULL,consumerThread,(void *)&con[i-1]);
  92.         if(ret!=0)
  93.         {
  94.             printf("Create thread error");
  95.             exit(1);
  96.         }
  97.     }
  98.     for(i=1;i<=ProdNum;i++)
  99.     {
  100.         pro[i-1]=i;
  101.     ret=pthread_create(&proid[i],NULL,productThread,(void *)&pro[i-1]);
  102.         if(ret!=0)
  103.         {
  104.             printf("Create thread error");
  105.             exit(1);
  106.         }
  107.     }
  108.     sleep((ConsNum+ ProdNum)*10);
  109.     if (writehistorycount>readhistorycount) max=writehistorycount;
  110.     else max=readhistorycount;
  111.     for(i=0;i<max;i++)
  112.         if ((i<writehistorycount) && (i<readhistorycount))
  113.             printf("%s | %s\n",writehistory[i],readhistory[i]);
  114.         else if (i<writehistorycount)
  115.             printf("%s | %s\n",writehistory[i]," ");
  116.         else    printf("%s | %s\n"," ",readhistory[i]);
  117.     printf("*************缓冲池的操作历史为：******************\n");
  118.     for(i=0;i<historycount;i++)  printf("%s",history[i]);
  119. }

编译链接命令：gcc pc2.c -o pc2 -lpthread

运行命令：./pc2

交互与结果：

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/weixin_40725706/article/detail/682611
推荐阅读
相关标签

Copyright © 2003-2013 www.wpsshop.cn 版权所有，并保留所有权利。

  

闽ICP备14008679号