2022年東北大學(xué)操作系統(tǒng)實(shí)驗(yàn)三報(bào)告

1、操作系統(tǒng)試驗(yàn)報(bào)告班級(jí)物聯(lián)網(wǎng) 1302 班學(xué)號(hào)姓名試驗(yàn) 3 進(jìn)程同步和通信 - 生產(chǎn)者和消費(fèi)者問題模擬1. 目的：調(diào)試、修改、運(yùn)行模擬程序,通過形象化的狀態(tài)顯示,使同學(xué)懂得進(jìn)程的概念,明白同步和通信的過程, 把握進(jìn)程通信和同步的機(jī)制, 特殊是利用緩沖區(qū)進(jìn)行同步和通信的過程；通過補(bǔ)充新功能,使同學(xué)能敏捷運(yùn)用相關(guān)學(xué)問,培育創(chuàng)新才能；2. 內(nèi)容及要求：1 調(diào)試、運(yùn)行模擬程序；2 發(fā)覺并修改程序中不完善的地方；3 修改程序,使用隨機(jī)數(shù)掌握創(chuàng)建生產(chǎn)者和消費(fèi)者的過程；4 在原先程序的基礎(chǔ)上, 加入緩沖區(qū)的寫互斥掌握功能,模擬多個(gè)進(jìn)程存取一個(gè)公共緩沖區(qū),當(dāng)有進(jìn)程正在寫緩沖區(qū)時(shí),其他要拜訪該緩沖區(qū)的進(jìn)程必需等待

2、,當(dāng)有進(jìn)程正在讀取 緩沖區(qū)時(shí),其他要求讀取的進(jìn)程可以拜訪,而要求寫的進(jìn)程應(yīng)當(dāng)?shù)却? 完成 1 、2 、3）功能的 , 得基本分 , 完成 4 功能的加 2 分, 有其它功能改進(jìn)的再加 2 分3. 程序說明：本程序是模擬兩個(gè)進(jìn)程,生產(chǎn)者（producer ）和消費(fèi)者 Consumer工作；生產(chǎn)者每次產(chǎn)生一個(gè)數(shù)據(jù),送入緩沖區(qū)中；消費(fèi)者每次從緩沖區(qū)中取走一個(gè)數(shù)據(jù)；緩沖區(qū)可以容納 8 個(gè)數(shù)據(jù)；由于緩沖區(qū)是有限的,因此當(dāng)其滿了時(shí)生產(chǎn)者進(jìn)程應(yīng)當(dāng)?shù)却?而空時(shí),消費(fèi)者進(jìn) 程應(yīng)當(dāng)?shù)却?；?dāng)生產(chǎn)者向緩沖區(qū)放入了一個(gè)數(shù)據(jù),應(yīng)喚醒正在等待的消費(fèi)者進(jìn)程,同樣,當(dāng)消費(fèi)者取走一個(gè)數(shù)據(jù)后,應(yīng)喚醒正在等待的生產(chǎn)者進(jìn)程；就是生產(chǎn)

3、者和消費(fèi)者之間的同步；每次寫入和讀出數(shù)據(jù)時(shí),都將讀和寫指針加一；當(dāng)讀寫指針同樣時(shí),又一起退回起點(diǎn)；當(dāng)寫指針指向最終時(shí),生產(chǎn)者就等待；當(dāng)讀指針為零時(shí),再次要讀取的消費(fèi)者也應(yīng)當(dāng)?shù)却?；為?jiǎn)潔起見,每次產(chǎn)生的數(shù)據(jù)為 是通過運(yùn)行者使用鍵盤來實(shí)現(xiàn)的；4. 程序使用的數(shù)據(jù)結(jié)構(gòu)0-99 的整數(shù),從 0 開頭,次序遞增；兩個(gè)進(jìn)程的調(diào)度進(jìn)程掌握塊：包括進(jìn)程名,進(jìn)程狀態(tài)和執(zhí)行次數(shù)；緩沖區(qū)：一個(gè)整數(shù)數(shù)組；緩沖區(qū)說明塊：包括類型,讀指針,寫指針,讀等待指針和寫等待指針；5. 程序使用說明啟動(dòng)程序后,假如使用p 鍵就運(yùn)行一次生產(chǎn)者進(jìn)程,使用c 鍵就運(yùn)行一次消費(fèi)者進(jìn)程；通過屏幕可以觀看到兩個(gè)進(jìn)程的狀態(tài)和緩沖區(qū)變化的情形；6

4、. 試驗(yàn)流程圖源程序#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