Execution without entering a deadlock state, Operating System

Q. Presume that a system is in an unsafe state. Illustrate that it is possible for the processes to complete their execution without entering a deadlock state.

Answer: An unsafe state mayn't necessarily lead to deadlock it just means that we cannot guarantee that deadlock will not take place. Therefore it is possible that a system in an unsafe state may still permit all processes to complete without deadlock occurring. Consider the circumstances where a system has 12 resources allocated among processes P0, P1, and P2. The resources are owed according to the following policy.

Posted Date: 7/27/2013 3:58:42 AM | Location : United States







Related Discussions:- Execution without entering a deadlock state, Assignment Help, Ask Question on Execution without entering a deadlock state, Get Answer, Expert's Help, Execution without entering a deadlock state Discussions

Write discussion on Execution without entering a deadlock state
Your posts are moderated
Related Questions
Describe when you run an unlink() operation to remove a file on the ext3 file system. Be specific about what disk blocks have to be written where in what order. State your assumpti

For reading, most operating systems use demand paging. This means that pages are only read from the disk into physical memory when they are needed. In the page table, there is a re

What makes a Just-in-Time inventory system differ from a traditional inventory system?

Windows admin need it Project Description: We want to protect an executable on operating system level , so the process could be visible among all users while the executable r

Assume that P A , P B and P C are three distinguished program s . When P A is executed, it needs 10 ticks to complete its execution and it forks new processes executing P B at tick


importance of Operating system in modern computers. Also explain various functions & types of operating systems

For the heat conduction problem, investigate the effects on the numerical solution of the following aspects: 1. non-uniform meshes with re?nement at both ends versus a uniform m

Q. Explain the differences in terms of cost between the three storage types nonvolatile, volatile and stable. Answer: Volatile storage refers to main as well as cache memory an

Relocation bits employed by relocating loader are specified by Relocation bits employed by relocating loader are specified by Assembler or Translator