ALL > Computer and Education > courses > university courses > undergraduate courses > Operating System > Class(2017-2018-1)ZSTU > student homework directory > >
homework_6 Version 0
👤 Author: by 970135274qqcom 2017-11-13 02:48:22
Consider  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.

 

Answer:

The rule is: hold and wait to prevent the occurrence of deadlock.

To ensure that the ho

Please login to reply. Login

Reversion History

Loading...
No reversions found.