homework6_deadlock Version 0 |
|
👤 Author: by zengrui96163com 2017-12-14 03:05:01 |
Dining -philosophers problem
Q:
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.
A:
When the four conditions are satisfied at the same time, which inc