ALL > Computer and Education > courses > university courses > undergraduate courses > Operating System > Class(2017-2018-1)ZSTU >
Homework_6 Version 0
👤 Author: by 951970312qqcom 2017-11-16 16:34:21
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 deadlock situation can arise in following nessary conditons:

1.Mutual Exclusion 2.Hold and Wait

Please login to reply. Login

Reversion History

Loading...
No reversions found.