操作系统课件ch7.ppt

* * * * * * * * * * * * * * * * * * * * * * * 7-cont. 3. Show that, if the wait and signal operations are not executed atomically, then mutual exclusion may be violated. 4. The Sleeping-Barber Problem. A barbershop consists of a waiting room with n chairs and the barber room containing the barber chair. If there are no customers to be served, the barber goes to sleep. If a customer enters the barbershop and all chairs are occupied, then the customer leaves the shop. If the barber is busy but chairs are available, then the customer sits in one of the free chairs. If the barber is asleep, the customer wakes up the barber. Write a program to coordinate the barber and the customers. 5. The Cigarette-Smokers Problem. Consider a system with three smoker processes and one agent process. Each smoker continuously rolls a cigarette and then smokes it. But to roll and smoke a cigarette, the smoker needs three ingredients: tobacco, paper, and matches. One of the smoker processes has paper, another has tobacco, and the third has matches. The agent has an infinite supply of all three materials. The agent places two of the ingredients on the table. The smoker who has the remaining ingredient then makes and smokes a cigarette, signaling the agent on completion. The agent then puts out another two of the three ingredients, and the cycle repeats. Write a program to synchronize the agent and the smokers. 6.阅读分析Linux中进程、线程同步代码 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Deadlock and Starvation Deadlock（死锁） – two or more processes are waiting indefinitely for an event that can be caused by only one of the waiting processes. Let S and Q be two semaphores initialized to 1 P0 P1 wait(S); wait(Q); wait(Q); wait(S); ? ? signal(S); signal(Q); signal(Q) signal(S); Starvation（饿死） – indefinite blocking. A process may never be removed from the semaphore queue in which it is suspended. Two Types of Semaphores Counting semaphore（计数信号量） – integer value can range ove