A set of vertices V and a set of edges E.
- V is partinioned into two types:
- P ={P1,P2,....Pn} the set consisting of all the processes in the system.
- R ={R1,R2,...Rm} the set consisting of all resource types in the system.
- request edge - directed edge P1---Rj
- assignment edge - directed edge Rj---Pi
- You will know if theres a deadlock base on allocation graph if the graph contains a cycle and if only one instance per resource type, and if several instances per resource type theres a posibility of deadlock.
0 comments:
Post a Comment