Explain the various methods for handling deadlocks, Operating System

Explain the various methods for handling deadlocks.

     A set of processes is deadlocked if every process in the set is waiting for an event that only a process in the set is able to cause. Deadlock be able to occur whenever two or more processes are competing for limited resources and the processes are allowed to acquire and hold a resource (obtain a lock) so preventing others from using the resource while the process waits for other resources.

    There are 4 essential conditions for deadlock to occur:

     1. Mutual exclusion

     2. Hold and wait    

     3. Non-preemption

     4. Circular wait:     

The dissimilar methods used by OS for handling deadlocks are:

a)      Deadlock detection and recovery

b)      Deadlock prevention

c)      Deadlock avoidance


Posted Date: 6/21/2013 7:51:06 AM | Location : United States

Related Discussions:- Explain the various methods for handling deadlocks, Assignment Help, Ask Question on Explain the various methods for handling deadlocks, Get Answer, Expert's Help, Explain the various methods for handling deadlocks Discussions

Write discussion on Explain the various methods for handling deadlocks
Your posts are moderated
Related Questions
What is Single-level Directory All files are constrained in the similar directory, which is simple to support and understood. One limitation is when the number of files enhance

What are the main advantages of the microkernel approach to system design? Benefits typically contain the following  (a) Adding a new service does not require modifying the

What is the hardware support required to implement paging? Each operating system has its own techniques for storing page tables. The majority allocates a page table for each pr

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

Q. Operating System as User Interface? • Every general purpose computer comprises the operating system, hardware, system programs and application programs. The hardware compris

LOOK o Like SCAN except stops moving inwards (or outwards) when no more requests in that direction exist. C-SCAN (circular scan) o Moves inwards servicing requests u

Consider the following C program where M, N, K are predefined constants. Assume int is 4 bytes. Suppose this program is run on a machine with 4KB page size and 32 TLB entries. Init

What is super block A partition control block have partitions details, such as the number of blocks in the partition, size of the blocks, free-blocks and free-block pointers an

advantage and dis advantage of threads