ALL > Computer and Education > courses > university courses > undergraduate courses > Operating System > zstu-(2021-2022)-1 > student homework directories > 2019327100017朱奕名 >
2019327100017朱奕名homework7 Version 0
👤 Author: by 1114774057qqcom 2021-12-30 04:50:52
Mutual exclusion:  only one process at a time can use a resource.

Hold and wait:  a process holding at least one resource is waiting to acquire additional resources held by other processes.

No preemption:  a resource can be released only voluntarily by the process holding it, after that process has completed its task.

Circular wait:  there exists a set {P0, P1, …, P0} of waiting processes such that P0 is waiting for a resource that is held by P1, P1 is waiting for a resource that is held by

P2, …, Pn–1 is waiting for a resource that is held by
Pn, and P0 is waiting for a resource that is held by P0.

 

The solution is starvation.

Please login to reply. Login

Reversion History

Loading...
No reversions found.