home-work6-deadlock Version 0 |
|
👤 Author: by 1370136004qqcom 2017-11-28 13:27:53 |
Question:Consider v the dining -philosophers problem where the chopsticks are placed at the center of the table and any two of them could be used by a philosopher. Assume that requests for chopsticks are made one at a time. Describe a simple rule for determining whether a particular request could be satisfied without causing deadlock given the current allocation of chopsticks to philosophers.
Solution:The rule is deadlock prevention.When a philosopher makes a request for the first chopsti