CS381 Homework - Suraj @ LUMS

Summer 2005-2006
5. [10]
Consider a system consisting of m resources of the same type being shared by n
processes. Resources can only be requested and released by processes one at a time (i.e.
they are non-sharable type). Show that the system is deadlock free if the following two
conditions hold:
• The maximum need of each process is between 1 and m resources
• The sum of all maximum needs is less than m+n
Hint: Show that the there exists a process P i whose Need i is zero. (I.e. it has at least one
resource it can release and hence the system cannot be in a deadlock state.)
Submission Instructions:
o Instructions about how and where to submit your homework will be posted on the
course website.