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
The Cigarette-Smokers difficulty Consider a system with three smoker processes and one agent process. Every smoker continuously rolls a cigarette and then smokes it. But to roll as

how the system call is work?

Define a linker program  A linker program links the program along with other programs required for its execution.

What is the sequence in which resources may be utilized? Under normal mode of operation, a process may utilize a resource in the following sequence: Request: If the requ

Suppose a logical address space is 1KB, and the page-size is 16 bytes. Assume no page is in the main memory for this process initially and the pure demand paging is used. Current f

Q. Show the services which provided by operating system? A) Resource Allocation: If there are more than one user or jobs running at the same instance then resource

Write on short note DMA. Direct M emory Access (DMA) is a technique for transferring data from  main to a device without passing it through the CPU. Computers that have

Q. The instance of handshaking used 2 bits: a busy bit as well as a command-ready bit. Is it probable to implement this handshaking with only 1 bit? If it is illustrate the protoc

Q. We have stressed the require for an operating system to make efficient use of the computing hardware. When is it suitable for the operating system to forsake this principle and

Problem: (a) Based on your experience in setting up Windows 2003 Server operating system, briefly describe the twelve different steps in which the installation is conducted du