Define the conditions of deadlock prevention, Operating System

Assignment Help:

What are the four necessary conditions of deadlock prevention?      

Ans:  Four essential conditions for deadlock prevention:

a. The meaning of removing the mutual exclusion condition is that no process may have exclusive access to a resource. This confirms impossible for resources that cannot be spooled, and even along with spooled resources deadlock could still occur. Algorithms which avoid mutual exclusion are called non-blocking synchronization algorithms.

b. The "hold and wait" conditions may be eliminated by requiring processes to request all the resources they will need previous to starting up. Another way is to need processes to release all their resources previous to requesting all the resources they will need.

c. A "no preemption" (lockout) condition may as well be difficult or impossible to evade as a process has to be able to have a resource for  a specific amount of time, or the processing outcome may be inconsistent or thrashing may occur. Though, inability to enforce preemption may interfere with a priority algorithm. Algorithms that permit preemption include lock-free and wait-free algorithms and optimistic concurrency control.

d. The circular wait condition: Algorithms which avoid circular waits contain "disable interrupts during critical sections", and "use a hierarchy to define a partial ordering of resources" and Dijkstra's solution.


Related Discussions:- Define the conditions of deadlock prevention

Explain tree structured directories structure, Tree structured directories:...

Tree structured directories: This is the main common directory structure. The tree has a root directory as well as every file in the system has a unique path name. A directory

Multiprogramming, what are the main advantages of multiprogramming

what are the main advantages of multiprogramming

Implement a network-transparent system, Q. What are two dreadful problems t...

Q. What are two dreadful problems that designers should solve to implement a network-transparent system? Answer: One such issue is making all the processors as well as storag

Difference among pre-emptive and non pre-emptive scheduling, Q. Define the ...

Q. Define the difference among pre-emptive and non pre-emptive scheduling. Answer: Pre-emptive scheduling permits a process to be interrupted in the midst of its execution ta

Define inter process communication (ipc), The term IPC (Inter-Process Commu...

The term IPC (Inter-Process Communication) defines several paths by which different process executing on some operating system interact between each other.

Ipc, Explain in detail about ipc in linux

Explain in detail about ipc in linux

What is sector sparing, What is sector sparing? Low-level formatting al...

What is sector sparing? Low-level formatting also sets aside extra sectors not visible to the operating system. The controller can be told to change each bad sector logically w

Explain the threadswitch function used in the netware, Explain the ThreadSw...

Explain the ThreadSwitch function used in the netware Since NetWare 3 and 4 are nonpreemptive environments, it may be necessary for the application developer to explicitly reli

What is meant by the term affinity in processor sheduling, Question: (a...

Question: (a) Answer the following questions based on the code snippet below. 1. int main (int argc, char *argv[]) 2. { 3. 4. pid_t processId; 5. 6. processId =

What are interrupts?, What are interrupts? Interrupts are in some way...

What are interrupts? Interrupts are in some ways the mainly "famous" system resources, ever since almost everyone who's used a computer has heard of them even if they don't k

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