ALL > Computer and Education > courses > university courses > undergraduate courses > Operating System > Class(2017-2018-1)ZSTU > student homework directory > 2015329620039_何彦珊 >
homework_6 Version 0
👤 Author: by 353575688qqcom 2017-11-17 01:58:30

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.


ANS:


1.problem analysis


Please login to reply. Login

Reversion History

Loading...
No reversions found.