Explain deadlock prevention, Operating System

Assignment Help:

Deadlock Prevention

Prevention is the name given to method that guarantee that deadlocks can never happen for the reason that the way the system is structured. Since 4 conditions are essential for deadlock to take place, it track that deadlock might be prevented by denying any one of the conditions. 

  • Elimination of "Mutual Exclusion" Condition

The mutual exclusion condition ought to hold for non-sharable resources. That is, several processes can't simultaneously share a single resource. 

  • Elimination of "Hold and Wait" Condition

There are two possibilities for exclusion of the second condition. The first substitute is that a process request be granted all of the resources it postulates at once, previous to execution. The second substitute is to disallow a process from requesting resources whenever it has previously allocated resources. This strategy needs that all of the resources a process will need must be requested at once. 

  • Elimination of "Non-preemption" Condition

The non-preemption condition is able to be alleviated by forcing a process waiting for a resource that cannot immediately be allocated to relinquish all of its currently held resources, thus that other processes may use them to finish.

  • Elimination of "Circular Wait" Condition

The last condition the "circular wait" is able to be denied by imposing a total ordering on all of the resource types and then forcing all processes to request the resources in order (increasing or decreasing). This strategy compel a total ordering of all resources kinds, and to need that each process requests resources in a numerical order (increasing or decreasing) of enumeration. With this rule the resource allocation graph is able to never have a cycle.


Related Discussions:- Explain deadlock prevention

Single-level page tables, As mentioned above, page tables, are lookup table...

As mentioned above, page tables, are lookup tables mapping a process' virtual pages to physical pages in RAM. How would one implement these page tables? The most straightforward

What is the translation look aside buffer (tlb), Translation Look aside Buf...

Translation Look aside Buffer In a cached system, the base addresses of the last few indexed pages is maintained in registers named the TLB that adds in faster lookup. TLB has

Binary and data representation, Computing uses three number bases:- Binary ...

Computing uses three number bases:- Binary (base 2), Octal (base 8) and Hexadecimal (base 16). Binary has been described before, although various catchphrases are used to describe

An operating system for a real-time environment, Q. What is the major diffi...

Q. What is the major difficulty that a programmer should overcome in writing an operating system for a real-time environment? Answer: The major difficulty is keeping the oper

How does an operating system make multiprogramming possible, How does an op...

How does an operating system make multiprogramming possible by using single processor?

Explain fifo page replacement, Explain FIFO page replacement A FIFO rep...

Explain FIFO page replacement A FIFO replacement algorithm associates with every page the time when that page was brought into memory. When a page must be changed, the oldest p

Unix , A friend has promised to log in at a particular time. However, he ne...

A friend has promised to log in at a particular time. However, he needs to be contacted as soon as he logs in. The shell script checks after every minute whether he has logged in o

What is an operating system process, What is an operating system process? H...

What is an operating system process? How is it different from a program? Why do we need the concept of a process, rather than simply talk about programs running in memory? The e

What is the basic approach of page replacement, What is the basic approach ...

What is the basic approach of page replacement? If no frame is free is available, find one that is not presently being used and free it. A frame can be freed by writing its con

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd