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
What problems arise if the directory structure is a general graph? Searching for a particular file may result in searching the similar directory many times. Deletion of the fil

A file system depends on data structures about the files, beside the file structure. The former is named metadata-data that defines data. Each file is accumulated with an inode, wh

Show the search tree generated by Hill-Climbing search (text figure 4.2, page 122; or Local Search lecture, slide 6) for each of the two heuristics (a) and (b) applied to the follo

Q. Segmentation is alike to paging but uses variable-sized "pages". Describe two segment-replacement algorithms based on FIFO and LRU page replacement schemes. Remember that since

The questions ask List four major functions of an OS. My answer: Function 1: Provide a user interface Function 2: Manage files Function 3: Manage hardware Function 4: Manage appli

Deadlock Avoidance It's a method to evade deadlock by careful resource scheduling. This approach to the deadlock problem foresees deadlock before it actually occurs. This a



Explain Structure The Grammar for programming language is a formal description of Structure