Deadlock - Example - Operating System

Q.  Consider a computer system with 6 tape drives and 'n' processes completing for them. What is the maximum value of 'n' for the system to be deadlock free? (Assuming that each processes may need 3 tape drives)
- Published on 25 Aug 15

a. 3
b. 2
c. 4
d. 7

ANSWER: 2

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 23 Nov 15
    - The system is guaranteed to be deadlock free is 2 from the maximum value of n.

    - Two processes can never lead to deadlock as the peak time demand of (3+3 =6) tape drives can be satisfied.

    - Three processes can lead to deadlock if each process hold 2 drives and then demand one more.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲