Write a note on deadlocks, Operating System

Write a note on deadlocks.

The proper definition of deadlock

A set of processes is deadlocked if every process in the set is waiting for an event that only a process in the set can cause.

There are four essential conditions for deadlock to occur. They are as follows:

Mutual Exclusion: Resources are not sharable.
Non-preemption: formerly a resource is given to a process it can't be revoked until the process voluntarily gives it up.
Hold and Wait: It is probable for a process that is holding resources to request more.
Circular wait: It is probable for there to be a cyclic pattern of requests.

The techniques used by OS for handling deadlock are:

Deadlock detection and recovery: Permit the system to enter a deadlock state, detect it and then recover.

Deadlock prevention: Use a protocol to make sure that the system will never enter a dead lock state.

3. Deadlock avoidance: Evade deadlock by careful resource scheduling.

Related Discussions:- Write a note on deadlocks

Explain the resource ownership by platform, Explain the Resource Ownership ...

Explain the Resource Ownership by Platform Ownership of data items may further be complicated by concepts defined in certain operating systems. Each operating system defines "p

Queing theory, how to solve queing theory step by step

how to solve queing theory step by step

Define swapping, Define swapping. A process requires being in memory to...

Define swapping. A process requires being in memory to be executed. Though a process can be swapped temporarily out of memory to a backing store and then brought back into memo

Buffering,

Define overflow chaining, Define Overflow Chaining Another method will ...

Define Overflow Chaining Another method will divide the pre-allocated table into two sections: the primary area to determine which keys are mapped and an area for collisions, g

Explain resource allocation graph, RESOURCE ALLOCATION GRAPH When a pro...

RESOURCE ALLOCATION GRAPH When a process Pi wishes an instance of resource type Rj, a request edge is inserted in the resource allocation graph. When this request is able to be

What is real time system, What is real time system? A real time system ...

What is real time system? A real time system has well explained, fixed time constraints. Processing must be done within the explained constraints, or the system will fail. It i

Compute the effective instruction time on the system, Q. An operating syst...

Q. An operating system sustains a paged virtual memory using a central processor with a cycle time of 1 microsecond. It costs an additional one microsecond to access a page other

Explain swapping, Explain Swapping Swapping is a method of temporarily ...

Explain Swapping Swapping is a method of temporarily removing inactive programs from the memory of computer system.

How many disks can be used effectively by one fast wide bus, Q. More than ...

Q. More than one disk drive is able to be attached to a SCSI bus. Especially a fast wide SCSI-II bus can be connected to at most 15 disk drives. Remember that this bus has a bandw

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages