For Students
Wednesday, 14 March 2012
Basic Facts
If graph contains no cycles
Þ
no deadlock.
If graph contains a cycle
Þ
if only one instance per resource type, then deadlock.
if several instances per resource type, possibility of deadlock.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment