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
Determine the reasons for Poor response time Process busy or High I/O rates or High paging rates

Inverted page table In page table the page table has one entry for every page that the process is using. The operating system must translate this reference into a physical memo

What are the most common schemes for defining the logical structure of a directory? The most common schemes for explaining the logical structure of a directory Single-L

what is the latest OS of ANDROID in US

Q. Illustrate Scope of Consumer behaviour ? Scope of consumer behaviour is extremely wide due to following reasons: >>Ever rising intensifying competition. >>Additional a

Explain the general structure of a typical process? There are basically four main sections through which each of the process has to pass through.The universal algorithm is:-

why we say" OS is a resource allocator" and “OS is a control program"?

Evicting the most-recently used (MRU) page does very well on LRU's worst case. In general, however, MRU is a bad idea, since many programs exhibit temporal locality in their memory

Define deadlock. A process requests resources; if the resources are not available at that time, the process enters a wait state. Waiting processes might be never again change s

What do you mean by system calls? System calls give the interface among a process and the operating system. When a system call is implemented, it is treated as by the hardware