2022年东北大学操作系统实验三报告

1、操作系统试验报告班级物联网 1302 班学号姓名试验 3 进程同步和通信 - 生产者和消费者问题模拟1. 目的：调试、修改、运行模拟程序,通过形象化的状态显示,使同学懂得进程的概念,明白同步和通信的过程, 把握进程通信和同步的机制, 特殊是利用缓冲区进行同步和通信的过程；通过补充新功能,使同学能敏捷运用相关学问,培育创新才能；2. 内容及要求：1 调试、运行模拟程序；2 发觉并修改程序中不完善的地方；3 修改程序,使用随机数掌握创建生产者和消费者的过程；4 在原先程序的基础上, 加入缓冲区的写互斥掌握功能,模拟多个进程存取一个公共缓冲区,当有进程正在写缓冲区时,其他要拜访该缓冲区的进程必需等待

2、,当有进程正在读取 缓冲区时,其他要求读取的进程可以拜访,而要求写的进程应当等待；5 完成 1 、2 、3）功能的 , 得基本分 , 完成 4 功能的加 2 分, 有其它功能改进的再加 2 分3. 程序说明：本程序是模拟两个进程,生产者（producer ）和消费者 Consumer工作；生产者每次产生一个数据,送入缓冲区中；消费者每次从缓冲区中取走一个数据；缓冲区可以容纳 8 个数据；由于缓冲区是有限的,因此当其满了时生产者进程应当等待,而空时,消费者进 程应当等待；当生产者向缓冲区放入了一个数据,应唤醒正在等待的消费者进程,同样,当消费者取走一个数据后,应唤醒正在等待的生产者进程；就是生产

3、者和消费者之间的同步；每次写入和读出数据时,都将读和写指针加一；当读写指针同样时,又一起退回起点；当写指针指向最终时,生产者就等待；当读指针为零时,再次要读取的消费者也应当等待；为简洁起见,每次产生的数据为 是通过运行者使用键盘来实现的；4. 程序使用的数据结构0-99 的整数,从 0 开头,次序递增；两个进程的调度进程掌握块：包括进程名,进程状态和执行次数；缓冲区：一个整数数组；缓冲区说明块：包括类型,读指针,写指针,读等待指针和写等待指针；5. 程序使用说明启动程序后,假如使用p 键就运行一次生产者进程,使用c 键就运行一次消费者进程；通过屏幕可以观看到两个进程的状态和缓冲区变化的情形；6

4、. 试验流程图源程序#include #include #include #define PIPESIZE 8 enum Status RUN, WAIT, READY ; #define NORMAL 0 #define SLEEP 1 #define AWAKE 2 struct PCB char name3; enum Status status; int time; ; struct waitqueue struct PCB pcb; struct waitqueue *next; ; struct PCB *producer; /* write wait point */ struc

5、t PCB *consumer; /* read wait point */ struct waitqueue *headerqueue, *tailqueue; int writeptr; int readptr; int writein, readout; int bufferPIPESIZE; int empty, full; void runpchar in3, runcchar in3, print; int main char in3; writeptr = 0; readptr = 0; writein = 0; empty = PIPESIZE; full = 0; produ

6、cer = struct PCB *mallocsizeofstruct PCB; consumer = struct PCB *mallocsizeofstruct PCB; headerqueue = struct waitqueue *mallocsizeofstruct waitqueue; headerqueue-next = NULL; tailqueue = headerqueue; producer-status = READY; consumer-status = WAIT; producer-time = consumer-time = 0; printfNow start

7、ing the program.n; printfPress p1 to run PRODUCER1,Press p1 to run PRODUCER2 n; printfPress c1 to run CONSUMER1,Press c2 to run CONSUMER2 n; printfPress e to exit from the program.n; while 1 strcpyin, N; while .strcmpin, N printfn; scanf%s, in; if strcmpin, e & strcmpin, p1 & strcmpin, p2 & strcmpin

8、, c1 & strcmpin, c2 printferror,please input again.n; strcpyin, N; if p = in0 runpin; producer-time+; else if c = in0 runcin; consumer-time+; else n, in; struct waitqueue *p = struct waitqueue *mallocsizeofstruct waitqueue; strcpyp-, in; p- = WAIT; p- = producer-time + 1; p-next = NULL; tailqueue-ne

9、xt = p; tailqueue = p; full+; else writein = writein + 1 % 100; producer-status = RUN; printfrun PRODUCER %s process . product %d , in, writein; bufferwriteptr = writein; if empty8 struct waitqueue *p; p = headerqueue-next; printfrun CONSUMER %s process. use %d, p-, bufferwriteptr; if tailqueue = p

10、tailqueue = headerqueue; headerqueue-next = p-next; freep; consumer-status = WAIT; empty-; else if writeptr readptr writeptr+; if writeptr = PIPESIZE writeptr = 0; if readptr = 0 producer-status = WAIT; else producer-status = READY; else writeptr+; if writeptr = readptr producer-status = WAIT; else

11、producer-status = READY; consumer-status = READY; empty-; full+; void runcchar in3 if empty = 8 struct waitqueue *search; search = headerqueue-next; while search .= NULL if .strcmpin, search- printferror.n; exit1; search = search-next; consumer-status = WAIT; printfCONSUMER %s is waiting, cant be sc

12、heduled.n,in; struct waitqueue *p = struct waitqueue *mallocsizeofstruct waitqueue; strcpyp-, in; p- = WAIT; p- = consumer-time + 1; p-next = NULL; tailqueue-next = p; tailqueue = p; empty+; else consumer-status = RUN; readout = bufferreadptr; printfrun CONSUMER %s process. use %d , in, readout; if

13、full8 writein = writein + 1 % 100; bufferwriteptr = writein; struct waitqueue *p; p = headerqueue-next; printfrun PRODUCER %s process. product %d , p-, bufferwriteptr; if tailqueue = p tailqueue = headerqueue; headerqueue-next = p-next; freep; producer-status = WAIT; full-; writeptr+; readptr+; else

14、 if readptr writeptr readptr+; if readptr = PIPESIZE readptr = 0; if writeptr = 0 consumer-status = WAIT; else consumer-status = READY; else consumer-status = READY; else readptr+; if readptr = writeptr consumer-status = WAIT; writeptr = readptr = 0; else consumer-status = READY; producer-status = R

15、EADY; full-; empty+; void print int i = 0; int j = 0; int low = 0; int high = 0; printfn; for i; i PIPESIZE; i+ printf-; printfn; if readptr writeptr for low = 0; low readptr; low+ printf| |; for low = readptr; low writeptr; low+ printf| %2d |, bufferlow; for low = writeptr; low writeptr for low = 0

16、; low writeptr; low+ printf| %2d |, bufferlow; for low = writeptr; low readptr; low+ printf| |; for low = readptr; low status = WAIT for low = 0; low PIPESIZE; low+ printf| %2d |, bufferlow; else for low = 0; low PIPESIZE; low+ printf| |; printfn; for i = 0; i status = WAIT & NULL .=headerqueue-next struct waitqueue *p = headerqueue-next; while NULL .= p printf PRODUCER %s proc