Unlocking Deadlocks: Causes, Conditions, and Prevention Strategies

Process Management

Deadlock

1. Concept of deadlock

A deadlock occurs when two or more processes wait indefinitely for conditions that can never be satisfied, causing the system to enter a stagnant state.

2. Causes of deadlock

Improper process execution order.

Improper allocation of mutually exclusive resources (insufficient remaining resources can lead to deadlock, though lack of resources alone is not the root cause).

System resource shortage is not the direct cause; deadlock arises when allocated resources cannot satisfy further requests, preventing process progress.

3. Four necessary conditions for deadlock

Mutual exclusion : Only one process may use a resource at a time.

Non‑preemption : Resources already held by a process cannot be forcibly taken away.

Hold and wait : A process holds some resources while requesting additional ones without releasing the held resources.

Circular wait : Processes form a circular chain where each is waiting for a resource held by the next.

4. Deadlock handling strategies

Common approaches include ignoring deadlocks, detecting and recovering from them, avoiding them, and preventing them.

4.1 Ignoring deadlocks

The typical “ostrich algorithm” simply ignores the problem.

4.2 Detection and recovery

Detection methods:

Resource‑allocation‑graph algorithm.

Resource‑matrix method.

Recovery techniques (selected from the table):

Resource preemption: suspend deadlocked processes and seize their resources.

Process termination: abort the process holding the most resources or the one with the lowest cost.

Process rollback: set a checkpoint and roll back one or more processes to a state that breaks the deadlock.

System restart: restart the entire system (most costly and generally avoided).

4.3 Deadlock avoidance

Key ideas:

Distinguish safe and unsafe states; a safe state allows a sequence of resource allocations that lets every process finish.

Banker’s algorithm: simulate resource allocation to ensure the system remains in a safe state before granting requests.

4.4 Deadlock prevention

Prevent deadlocks by breaking one of the four necessary conditions, such as:

Eliminate mutual exclusion (e.g., make devices shareable via spooling).

Allow preemption of resources (temporarily release resources when a new request cannot be satisfied).

Require processes to request all needed resources at once.

Impose an ordered resource allocation scheme (assign numbers to resources and request them in increasing order).

-----The End-----