7.11.2 [10] <7.4> Describe how we can solve this problem by introducing the  concept of a priority? But can we guarantee that we will treat all the philosophers  fairly? Explain.
Now assume we hire a waiter who is in charge of assigning forks to philosophers.  Nobody can pick up a fork until the waiter says they can. The waiter has global knowledge of all forks. Further, if we impose the policy that philosophers will  always request to pick up their left fork before requesting to pick up their right  fork, then we can guarantee to avoid deadlock.
 
 
View Solution
 
 
 
<< Back Next >>