臨界區死鎖模擬.

今天覆習了一下操作系統的一些知識,做了一爭奪個臨界區資源死鎖的實現,下面是實驗的源代碼.

#include<iostream.h> #include<windows.h> DWORD WINAPI Fun1Proc( LPVOID lpParameter // thread data ); DWORD WINAPI Fun2Proc( LPVOID lpParameter // thread data ); int tickets = 100; CRITICAL_SECTION g_csA; CRITICAL_SECTION g_csB; void main() { HANDLE hThread1; HANDLE hThread2; hThread1 = CreateThread(NULL,0,Fun1Proc,NULL,0,NULL); hThread2 = CreateThread(NULL,0,Fun2Proc,NULL,0,NULL); CloseHandle(hThread1); CloseHandle(hThread2); InitializeCriticalSection(&g_csA); InitializeCriticalSection(&g_csB); Sleep(4000); DeleteCriticalSection(&g_csB); DeleteCriticalSection(&g_csA); } DWORD WINAPI Fun1Proc( LPVOID lpParameter // thread data ) { while(TRUE) { EnterCriticalSection(&g_csA); Sleep(1); EnterCriticalSection(&g_csB); // EnterCriticalSection(&g_cs);//判斷能否得到臨界區對象所有權 if(tickets > 0) { Sleep(1); cout<<"thread1 sell tickets"<<tickets--<<endl; } else break; // LeaveCriticalSection(&g_cs); LeaveCriticalSection(&g_csB); LeaveCriticalSection(&g_csA); } return 1; } DWORD WINAPI Fun2Proc( LPVOID lpParameter // thread data ) { while(TRUE) { EnterCriticalSection(&g_csB); Sleep(1); EnterCriticalSection(&g_csA); // EnterCriticalSection(&g_cs); if(tickets > 0) { Sleep(1); cout<<"thread2 sell tickets"<<tickets--<<endl; } else break; // LeaveCriticalSection(&g_cs); LeaveCriticalSection(&g_csA); LeaveCriticalSection(&g_csB); } return 1; }

在學校時,這一部分知識我還是掌握得不錯的.不過當時沒有做過這個實驗,現在補做一下.

做實驗與看理論比起來真的是輕鬆了許多.當然上面的有一些代碼是可以刪除的.因爲沒有影響,所以就放着了.