實驗三：生產(chǎn)者與消費者(共20頁)

1、精選優(yōu)質(zhì)文檔-傾情為你奉上實驗三：生產(chǎn)者與消費者一、 實驗?zāi)康?.學(xué)習(xí)和掌握操作系統(tǒng)中進程之間的通信；2.理解和掌握使用信號量機制來是想進程之間的同步和互斥；3.學(xué)習(xí)使用創(chuàng)建文件對象，并利用文件映射對象來實現(xiàn)數(shù)據(jù)通信。二、實驗內(nèi)容 一個大小為6的緩沖區(qū)，初始為空，每個緩沖區(qū)能存放一個長度若為10個字符的字符串。 2個生產(chǎn)者 隨機等待一段時間，往緩沖區(qū)添加數(shù)據(jù)， 若緩沖區(qū)已滿，等待消費者取走數(shù)據(jù)后再添加 重復(fù)12次 3個消費者 隨機等待一段時間，從緩沖區(qū)讀取數(shù)據(jù) 若緩沖區(qū)為空，等待生產(chǎn)者添加數(shù)據(jù)后再讀取 重復(fù)8次說明： 顯示每次添加和讀取數(shù)據(jù)的時間及緩沖區(qū)的狀態(tài) 生產(chǎn)者和消費者用進程模擬，緩沖區(qū)

2、用共享內(nèi)存來實現(xiàn)三、 實驗環(huán)境1. Windows下：Windows8 ,Visual studio 20132. Linux下：Linux Ubuntu 4，gcc四、 程序設(shè)計與實現(xiàn)1. Windows下：A 主要函數(shù)說明：（1） PROCESS_INFORMATIONStartClone(intnCloneID)功能：用來創(chuàng)建5個相同的進程，前兩個為生產(chǎn)者，后三兩個為消費者，賦予其不同的ID值，返回進程的信息。（2） CreateSemaphore（）；功能：創(chuàng)建3個信號量：full，empty，mutex。來互斥的訪問緩沖區(qū)，實現(xiàn)通信。（3） CreateFileMapping（）功能

3、：在當前運行的進程中創(chuàng)建文件映射對象，來模擬共享緩沖區(qū)MapViewOfFile（）功能：在此文件映射上創(chuàng)建視圖映射到當前應(yīng)用程序的地址空間B 程序流程圖開始初始化:創(chuàng)建的子進程個數(shù)為0nClone=0;創(chuàng)建5個相同的子進程nClone+2<nClone<60<nClone<3申請緩沖區(qū)P(full)P(mutex)申請緩沖區(qū)P(empty)P(mutex)nClone=?0從緩沖區(qū)取產(chǎn)品：將1置為0創(chuàng)建3個信號量：full ,empty,mutex把產(chǎn)品放入緩沖區(qū)：將0置為1釋放緩沖區(qū)：V(mutex)V(empty)釋放緩沖區(qū)：V(mutex)V(full)創(chuàng)建共享

4、內(nèi)存NN隨機等待隨機等待等待子進程執(zhí)行完畢12次取完了？12次放完了？YY結(jié)束每個子進程結(jié)束實驗代碼如下：Windows：/ 實驗三.cpp : 定義控制臺應(yīng)用程序的入口點。/#include "stdafx.h"#include <stdio.h> #include <windows.h> #include <time.h> static HANDLE hMutexMapping=INVALID_HANDLE_VALUE; int num=0; HANDLE lpHandle10; struct buf int num; int rea

5、d; int write; int buffer5; ; BOOL StartClone() int i; BOOL bCreateOK; PROCESS_INFORMATION pi; TCHAR szFilenameMAX_PATH; GetModuleFileName(NULL,szFilename,MAX_PATH); TCHAR szCmdLineMAX_PATH; for ( i = 0; i < 3; i+) sprintf(szCmdLine,""%s" consumer %d",szFilename,i); STARTUPINFO

6、 si; ZeroMemory(reinterpret_cast<void *>(&si),sizeof(si); si.cb=sizeof(si); bCreateOK=CreateProcess( szFilename, szCmdLine, NULL, NULL, FALSE, CREATE_DEFAULT_ERROR_MODE, NULL, NULL, &si, &pi); if (!bCreateOK) return false; lpHandlenum=pi.hProcess; num+; for ( i = 0; i < 2; i+) s

7、printf(szCmdLine,""%s" productor %d",szFilename,i); STARTUPINFO si; ZeroMemory(reinterpret_cast<void *>(&si),sizeof(si); si.cb=sizeof(si); bCreateOK=CreateProcess( szFilename, szCmdLine, NULL, NULL, FALSE, CREATE_DEFAULT_ERROR_MODE, NULL, NULL, &si, &pi); if (!b

8、CreateOK) return false; lpHandlenum=pi.hProcess; num+; return true; void Parent() printf("Creating the child process and waited child process to quit.n"); hMutexMapping=CreateMutex(NULL,true,"mutex"); HANDLE hMapping=CreateFileMapping( NULL, NULL, PAGE_READWRITE, 0, sizeof(LONG),

9、 "map"); if (hMapping!=INVALID_HANDLE_VALUE) LPVOID pData=MapViewOfFile( hMapping, FILE_MAP_ALL_ACCESS, 0, 0, 0); if (pData!=NULL) ZeroMemory(pData,sizeof(LONG); struct buf *pnData=reinterpret_cast<struct buf *>(pData); pnData->read=0; pnData->write=0; pnData->num=0; memset(

10、pnData->buffer,0,sizeof(pnData->buffer); UnmapViewOfFile(pData); CreateSemaphore(NULL,3,3,"EMPTY"); CreateSemaphore(NULL,0,3,"FULL"); BOOL bCreateOK=StartClone(); if (!bCreateOK) /printf("Create child process failed.n"); else /printf("Create child process suc

11、cess.n"); ReleaseMutex(hMutexMapping); void Productor(int n) int j; printf("Productor is running.n"); hMutexMapping=OpenMutex(MUTEX_ALL_ACCESS,true,"mutex"); HANDLE hMapping=OpenFileMapping( FILE_MAP_ALL_ACCESS, NULL, "map"); if (hMapping=INVALID_HANDLE_VALUE) prin

12、tf("errorn"); HANDLE semEmpty = OpenSemaphore(SEMAPHORE_ALL_ACCESS,FALSE,"EMPTY"); HANDLE semFull = OpenSemaphore(SEMAPHORE_ALL_ACCESS,FALSE,"FULL"); for (int i = 0; i < 6; i+) WaitForSingleObject(semEmpty, INFINITE); SYSTEMTIME st; GetSystemTime(&st); srand(unsi

13、gned)time(0); Sleep(rand()/6); WaitForSingleObject(hMutexMapping,INFINITE); LPVOID pFile=MapViewOfFile( hMapping, FILE_MAP_ALL_ACCESS, 0, 0, 0); if (pFile!=NULL) struct buf *pnData=reinterpret_cast<struct buf *>(pFile); pnData->bufferpnData->write=1; pnData->write=(pnData->write+1)

14、%3; pnData->num+; printf("%02d:%02d:%02d 生產(chǎn)者%d生產(chǎn)成功 緩沖區(qū)中剩余%d個 ",st.wHour,st.wMinute,st.wSecond,n,pnData->num); for (j = 0; j < 3; j+) printf("%d ",pnData->bufferj); printf("n"); UnmapViewOfFile(pFile); pFile=NULL; ReleaseSemaphore(semFull, 1, NULL); ReleaseMu

15、tex(hMutexMapping); printf("生產(chǎn)者%d生產(chǎn)完畢n",n); void Consumer(int n) int j; printf("Consumer is running.n"); hMutexMapping=OpenMutex(MUTEX_ALL_ACCESS,true,"mutex"); HANDLE hMapping=OpenFileMapping( FILE_MAP_ALL_ACCESS, NULL, "map"); if (hMapping=INVALID_HANDLE_VAL

16、UE) printf("errorn"); HANDLE semEmpty = OpenSemaphore(SEMAPHORE_ALL_ACCESS,FALSE,"EMPTY"); HANDLE semFull = OpenSemaphore(SEMAPHORE_ALL_ACCESS,FALSE,"FULL"); for (int i = 0; i < 4; i+) WaitForSingleObject(semFull, INFINITE); SYSTEMTIME st; GetSystemTime(&st); sra

17、nd(unsigned)time(0); Sleep(rand()/6); WaitForSingleObject(hMutexMapping,INFINITE); LPVOID pFile=MapViewOfFile( hMapping, FILE_MAP_ALL_ACCESS, 0, 0, 0); if (pFile!=NULL) struct buf *pnData=reinterpret_cast<struct buf *>(pFile); pnData->bufferpnData->read=0; pnData->read=(pnData->rea

18、d+1)%3; pnData->num-; printf("%02d:%02d:%02d 消費者%d消費成功 緩沖區(qū)中剩余%d個 ",st.wHour,st.wMinute,st.wSecond,n,pnData->num); for (j = 0; j < 3; j+) printf("%d ",pnData->bufferj); printf("n"); UnmapViewOfFile(pFile); pFile=NULL; ReleaseSemaphore(semEmpty,1,NULL); Releas

19、eMutex(hMutexMapping); printf("消費者%d消費完畢n",n); int main(int argc,char *argv) if (argc>1&&strcmp(argv1,"productor")=0) Productor(atoi(argv2); else if (argc>1&&strcmp(argv1,"consumer")=0) Consumer(atoi(argv2); else Parent(); WaitForMultipleObjects(nu

20、m,lpHandle,true,INFINITE); return 0; Linux下代碼：/主進程#include <unistd.h>#include <stdlib.h>#include "head.h"int main()int id = semget(SEM_ALL_KEY, 3, IPC_CREAT|0660);/創(chuàng)建信號量集合/初始化信號量集合semctl(id, SEM_EMPTY, SETVAL, 3);semctl(id, SEM_FULL, SETVAL, 0);semctl(id, SEM_MUTEX, SETVAL, 1);

21、int shmid = createQueue();/創(chuàng)建共享主存if(shmid<0)perror("create shm error.");exit(1);/生成生產(chǎn)者進程if(fork()=0)execl("producer", "producer1", 0);if(fork()=0)execl("producer", "producer2", 0);/生成消費者進程if(fork()=0)execl("consumer", "consumer1&quo

22、t;, 0);if(fork()=0)execl("consumer", "consumer2", 0);if(fork()=0)execl("consumer", "consumer3", 0);/等待子進程int stat,i;for(i=0;i<5;i+)wait(&stat);removeQueue(shmid);/釋放共享主存return 0;/*生產(chǎn)者*/#include "head.h"main(int argc,char * argv)struct queue *b

23、uf,*out;int sem_id = semget(SEM_ALL_KEY,3, IPC_CREAT|0660);int i,j;buf = getQueue();/打開共享主存out = buf;for(i=0;i<6;i+)p(sem_id, SEM_EMPTY);/P(EMPTY)，EMPTY開始值為3，表明有三個空余，申請一個之后，有兩個空余，當為零時，不再往里面寫數(shù)據(jù)p(sem_id, SEM_MUTEX);/P(MUTEX)，MUTEX開始值為1，表明一次只能運行一個進程buf->buf+;/產(chǎn)品數(shù)+1(buf + buf->buf) ->buf = 1

24、;/放入產(chǎn)品后緩沖區(qū)置1/獲取當前時間struct timeval curtime;gettimeofday(&curtime,NULL);/輸出信息printf("No.%s put product %ld:%ld ",argv0,curtime.tv_sec,curtime.tv_usec);printf("Now the buffer is ");for(j=1;j<=3;j+)printf("%4d",(out+j)->buf);printf("n");v(sem_id, SEM_MUTEX);/V(MUTEX)v(sem_id, SEM_FULL);/V(FULL)，釋放一個FULL，即往里面寫了一個數(shù)據(jù)/隨機