Wednesday 14 March 2012

Basic Facts


  • If graph contains no cycles Þ no deadlock.
  • If graph contains a cycle Þ 
  1. if only one instance per resource type, then deadlock.
  2. if several instances per resource type, possibility of deadlock.
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)