Assignment5Solution

Assignment5Solution - Assignment 5 Deadlocks and Memory...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Assignment 5 Deadlocks and Memory Management CSCI 5103, Fall 2010 (November 10, 2010) Problem 1 Solution: We prove it by contradiction. Assume that the above two conditions hold. Suppose there is a deadlock in this system. This means that all n resources are allocated to the deadlocked set of processes, and each process in this set is waiting for one more resources The processes not involved in the deadlock must not be holding any resource. Let us denote the set of deadlocked processes as D and assume that it has k processes. ∑ hold((i) = m summation over all i in set D. Each processes in set D is requesting one more resource. D contains k processes. Therefore: ∑ need(i) (for all i in D) ∑ hold((i) + k ∑ need(i) (for all i in D) m + k ……… (a) There are (n-k) processes that are not involved in the deadlock situation and they do NOT currently hold any resource. However, each has a Need for at least 1 resource, as by condition given in (1) in the problem statement. ∑ need(i) (for all i in non-deadlocked set of processes)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

Assignment5Solution - Assignment 5 Deadlocks and Memory...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online