實(shí)驗(yàn)三：生產(chǎn)者與消費(fèi)者

實(shí)驗(yàn)三：生產(chǎn)者與消費(fèi)者一、 實(shí)驗(yàn)?zāi)康?.學(xué)習(xí)和掌握操作系統(tǒng)中進(jìn)程之間的通信；2.理解和掌握使用信號(hào)量機(jī)制來(lái)是想進(jìn)程之間的同步和互斥；3.學(xué)習(xí)使用創(chuàng)建文件對(duì)象，并利用文件映射對(duì)象來(lái)實(shí)現(xiàn)數(shù)據(jù)通信。二、實(shí)驗(yàn)內(nèi)容 一個(gè)大小為6的緩沖區(qū)，初始為空，每個(gè)緩沖區(qū)能存放一個(gè)長(zhǎng)度若為10個(gè)字符的字符串。 2個(gè)生產(chǎn)者 隨機(jī)等待一段時(shí)間，往緩沖區(qū)添加數(shù)據(jù)， 若緩沖區(qū)已滿(mǎn)，等待消費(fèi)者取走數(shù)據(jù)后再添加 重復(fù)12次 3個(gè)消費(fèi)者 隨機(jī)等待一段時(shí)間，從緩沖區(qū)讀取數(shù)據(jù) 若緩沖區(qū)為空，等待生產(chǎn)者添加數(shù)據(jù)后再讀取 重復(fù)8次說(shuō)明： 顯示每次添加和讀取數(shù)據(jù)的時(shí)間及緩沖區(qū)的狀態(tài) 生產(chǎn)者和消費(fèi)者用進(jìn)程模擬，緩沖區(qū)用共享內(nèi)存來(lái)實(shí)現(xiàn)三、 實(shí)驗(yàn)環(huán)境1. Windows下：Windows8 ,Visual studio 20132. Linux下：Linux Ubuntu 4，gcc四、 程序設(shè)計(jì)與實(shí)現(xiàn)1. Windows下：A 主要函數(shù)說(shuō)明：（1） PROCESS_INFORMATIONStartClone(intnCloneID)功能：用來(lái)創(chuàng)建5個(gè)相同的進(jìn)程，前兩個(gè)為生產(chǎn)者，后三兩個(gè)為消費(fèi)者，賦予其不同的ID值，返回進(jìn)程的信息。（2） CreateSemaphore（）；功能：創(chuàng)建3個(gè)信號(hào)量：full，empty，mutex。來(lái)互斥的訪問(wèn)緩沖區(qū)，實(shí)現(xiàn)通信。（3） CreateFileMapping（）功能：在當(dāng)前運(yùn)行的進(jìn)程中創(chuàng)建文件映射對(duì)象，來(lái)模擬共享緩沖區(qū)MapViewOfFile（）功能：在此文件映射上創(chuàng)建視圖映射到當(dāng)前應(yīng)用程序的地址空間B 程序流程圖開(kāi)始初始化:創(chuàng)建的子進(jìn)程個(gè)數(shù)為0nClone=0;創(chuàng)建5個(gè)相同的子進(jìn)程nClone+2nClone60nClone3申請(qǐng)緩沖區(qū)P(full)P(mutex)申請(qǐng)緩沖區(qū)P(empty)P(mutex)nClone=?0從緩沖區(qū)取產(chǎn)品：將1置為0創(chuàng)建3個(gè)信號(hào)量：full ,empty,mutex把產(chǎn)品放入緩沖區(qū)：將0置為1釋放緩沖區(qū)：V(mutex)V(empty)釋放緩沖區(qū)：V(mutex)V(full)創(chuàng)建共享內(nèi)存NN隨機(jī)等待隨機(jī)等待等待子進(jìn)程執(zhí)行完畢12次取完了？12次放完了？YY結(jié)束每個(gè)子進(jìn)程結(jié)束實(shí)驗(yàn)代碼如下：Windows：/ 實(shí)驗(yàn)三.cpp : 定義控制臺(tái)應(yīng)用程序的入口點(diǎn)。/#include stdafx.h#include #include #include static HANDLE hMutexMapping=INVALID_HANDLE_VALUE; int num=0; HANDLE lpHandle10; struct buf int num; int read; 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 si; ZeroMemory(reinterpret_cast(&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+) sprintf(szCmdLine,%s productor %d,szFilename,i); STARTUPINFO si; ZeroMemory(reinterpret_cast(&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+; 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), 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(pData); pnData-read=0; pnData-write=0; pnData-num=0; memset(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 success.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) printf(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(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(pFile); pnData-bufferpnData-write=1; pnData-write=(pnData-write+1)%3; pnData-num+; printf(%02d:%02d:%02d 生產(chǎn)者%d生產(chǎn)成功 緩沖區(qū)中剩余%d個(gè) ,st.wHour,st.wMinute,st.wSecond,n,pnData-num); for (j = 0; j bufferj); printf(n); UnmapViewOfFile(pFile); pFile=NULL; ReleaseSemaphore(semFull, 1, NULL); ReleaseMutex(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_VALUE) 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); srand(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(pFile); pnData-bufferpnData-read=0; pnData-read=(pnData-read+1)%3; pnData-num-; printf(%02d:%02d:%02d 消費(fèi)者%d消費(fèi)成功 緩沖區(qū)中剩余%d個(gè) ,st.wHour,st.wMinute,st.wSecond,n,pnData-num); for (j = 0; j bufferj); printf(n); UnmapViewOfFile(pFile); pFile=NULL; ReleaseSemaphore(semEmpty,1,NULL); ReleaseMutex(hMutexMapping); printf(消費(fèi)者%d消費(fèi)完畢n,n); int main(int argc,char *argv) if (argc1&strcmp(argv1,productor)=0) Productor(atoi(argv2); else if (argc1&strcmp(argv1,consumer)=0) Consumer(atoi(argv2); else Parent(); WaitForMultipleObjects(num,lpHandle,true,INFINITE); return 0; Linux下代碼：/主進(jìn)程#include #include #include head.hint main()int id = semget(SEM_ALL_KEY, 3, IPC_CREAT|0660);/創(chuàng)建信號(hào)量集合/初始化信號(hào)量集合semctl(id, SEM_EMPTY, SETVAL, 3);semctl(id, SEM_FULL, SETVAL, 0);semctl(id, SEM_MUTEX, SETVAL, 1);int shmid = createQueue();/創(chuàng)建共享主存if(shmid0)perror(create shm error.);exit(1);/生成生產(chǎn)者進(jìn)程if(fork()=0)execl(producer, producer1, 0);if(fork()=0)execl(producer, producer2, 0);/生成消費(fèi)者進(jìn)程if(fork()=0)execl(consumer, consumer1, 0);if(fork()=0)execl(consumer, consumer2, 0);if(fork()=0)execl(consumer, consumer3, 0);/等待子進(jìn)程int stat,i;for(i=0;i5;i+)wait(&stat);removeQueue(shmid);/釋放共享主存return 0;/*生產(chǎn)者*/#include head.hmain(int argc,char * argv)struct queue *buf,*out;int sem_id = semget(SEM_ALL_KEY,3, IPC_CREAT|0660);int i,j;buf = getQueue();/打開(kāi)共享主存out = buf;for(i=0;ibuf+;/產(chǎn)品數(shù)+1(buf + buf-buf) -buf = 1;/放入產(chǎn)品后緩沖區(qū)置1/獲取當(dāng)前時(shí)間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=