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
UNIX systems utilized to use disk-layout optimizations based on the rotation position of disk data however modern implementations including Linux simply optimize for sequential dat

explain about oprating system services and topics briefly

Sharing segments between processes without requiring the same segment number is possible in a dynamically linked segmentation system. a. Define a system that permits sta

what is it all about? why do we need? what are the types of backup? how is it done in unix?

Develop a user mode command interpreter which support these functions: "list-short" -- just like ls without any options "list-long" -- same as ls -l "change" -- same as cd Your co

People arrive at a barber shop at the rate of one every 4.5 minutes. If the shop is full (it can hold five people altogether), 30% of the potential customers leave and come back i

The drawbacks of fixed partitioning are: The number of partitions are précised at system generation time limits the number of active processes in the system. For the re

Define a public key encryption system Allows just the correct receiver to decode the data

How many disk operations are needed to fetch the i-node for the file /usr/ast/courses/os/handout.t? Assume that the i-node for the root directory is in memory, but nothing else alo

Entry-sequenced file organization The records in an entry-sequenced file are store up in the order they are written into the file. New records are for all time appended to