實驗三：生產者與消費者一、 實驗目的1.學習和掌握操作系統中進程之間的通信；2.理解和掌握使用信號量機制來是想進程之間的同步和互斥；3.學習使用創建文件對象，并利用文件映射對象來實現數據通信。二、實驗內容 一個大小為6的緩沖區，初始為空，每個緩沖區能存放一個長度若為10個字符的字符串。 2個生產者 隨機等待一段時間，往緩沖區添加數據， 若緩沖區已滿，等待消費者取走數據后再添加 重復12次 3個消費者 隨機等待一段時間，從緩沖區讀取數據 若緩沖區為空，等待生產者添加數據后再讀取 重復8次說明： 顯示每次添加和讀取數據的時間及緩沖區的狀態 生產者和消費者用進程模擬，緩沖區用共享內存來實現三、 實驗環境1. Windows下：Windows8 ,Visual studio 20132. Linux下：Linux Ubuntu 4，gcc四、 程序設計與實現1. Windows下：A 主要函數說明：（1） PROCESS_INFORMATIONStartClone(intnCloneID)功能：用來創建5個相同的進程，前兩個為生產者，后三兩個為消費者，賦予其不同的ID值，返回進程的信息。（2） CreateSemaphore（）；功能：創建3個信號量：full，empty，mutex。來互斥的訪問緩沖區，實現通信。（3） CreateFileMapping（）功能：在當前運行的進程中創建文件映射對象，來模擬共享緩沖區MapViewOfFile（）功能：在此文件映射上創建視圖映射到當前應用程序的地址空間B 程序流程圖開始初始化:創建的子進程個數為0nClone=0;創建5個相同的子進程nClone+2nClone60nClone3申請緩沖區P(full)P(mutex)申請緩沖區P(empty)P(mutex)nClone=?0從緩沖區取產品：將1置為0創建3個信號量：full ,empty,mutex把產品放入緩沖區：將0置為1釋放緩沖區：V(mutex)V(empty)釋放緩沖區：V(mutex)V(full)創建共享內存NN隨機等待隨機等待等待子進程執行完畢12次取完了？12次放完了？YY結束每個子進程結束實驗代碼如下：Windows：/ 實驗三.cpp : 定義控制臺應用程序的入口點。/#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 生產者%d生產成功 緩沖區中剩余%d個 ,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(生產者%d生產完畢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 消費者%d消費成功 緩沖區中剩余%d個 ,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(消費者%d消費完畢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下代碼：/主進程#include #include #include head.hint main()int id = semget(SEM_ALL_KEY, 3, IPC_CREAT|0660);/創建信號量集合/初始化信號量集合semctl(id, SEM_EMPTY, SETVAL, 3);semctl(id, SEM_FULL, SETVAL, 0);semctl(id, SEM_MUTEX, SETVAL, 1);int shmid = createQueue();/創建共享主存if(shmid0)perror(create shm error.);exit(1);/生成生產者進程if(fork()=0)execl(producer, producer1, 0);if(fork()=0)execl(producer, producer2, 0);/生成消費者進程if(fork()=0)execl(consumer, consumer1, 0);if(fork()=0)execl(consumer, consumer2, 0);if(fork()=0)execl(consumer, consumer3, 0);/等待子進程int stat,i;for(i=0;i5;i+)wait(&stat);removeQueue(shmid);/釋放共享主存return 0;/*生產者*/#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();/打開共享主存out = buf;for(i=0;ibuf+;/產品數+1(buf + buf-buf) -buf = 1;/放入產品后緩沖區置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=