Synchronization and Deadlocks

This Galvin topic covers concurrency control. You solve critical-section problems with semaphores and monitors, reason about the four necessary conditions for deadlock, apply the Banker’s algorithm for avoidance, and compare prevention, detection and recovery strategies.

Relation 1 —

Write this relation with symbols exactly as in Operating System Concepts — Silberschatz, Galvin & Gagne before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.

Relation 2 —

Write this relation with symbols exactly as in Operating System Concepts — Silberschatz, Galvin & Gagne before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.

Relation 3 —

Write this relation with symbols exactly as in Operating System Concepts — Silberschatz, Galvin & Gagne before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.

When threads share data, uncontrolled interleaving causes race conditions, so mutual exclusion protects the critical section — semaphores (a counter with atomic wait/signal) and monitors (language-level locks with condition variables) provide it. But locking introduces deadlock: if processes hold resources while waiting for others in a cycle, and none will preempt, everyone blocks forever. All four Coffman conditions must hold simultaneously, so breaking any one prevents deadlock. Avoidance instead stays in safe states — the Banker’s algorithm grants a resource only if a sequence exists in which every process can still finish. Detection lets deadlock happen and then recovers by aborting or preempting.

State assumptions explicitly before using any relation for synchronization and deadlocks — steady state, uniform properties, linear elastic material, ideal gas, incompressible flow, etc., as applicable.

Wrong assumptions invalidate the entire solution even when the formula is correct. In Operating Systems viva and GATE descriptive questions, listing valid assumptions often earns separate marks.

1. Read the question and list given data with SI units (common in Operating Systems papers).
2. Draw a neat labelled diagram where applicable — examiners in Indian universities award diagram marks even when arithmetic slips.
3. Identify which relation from this topic applies to synchronization and deadlocks.
4. Use equation 1: .
5. Use equation 2: .
6. Substitute values, compute, and verify units and sign (direction).
7. State conclusion in one line — e.g. safe/unsafe, stable/unstable, feasible/infeasible.

Synchronization and Deadlocks appears in systems software and backend. In Indian it software curricula this topic is tested because it connects theory to process, memory, and file management.

GATE and semester exams often combine synchronization and deadlocks with earlier units — revise prerequisites before attempting mixed problems.

Industry interview panels sometimes ask: "Where did you use synchronization and deadlocks?" — answer with a lab, mini-project, or plant visit example if possible.

Students break only some Coffman conditions and still expect deadlock (all four are needed together), misapply the Banker’s algorithm by not checking for a safe sequence, and confuse a mutex (ownership) with a counting semaphore. Forgetting that a semaphore’s wait/signal must be atomic leads to wrong reasoning.

Before attempting synchronization and deadlocks problems, confirm you can:

1. Mutex versus binary semaphore; counting semaphores manage pools
2. Deadlock prevention breaks one Coffman condition
3. A monitor is a high-level lock plus condition variables

Revise the solved examples in Operating System Concepts — Silberschatz, Galvin & Gagne and one previous-year GATE or university paper for this unit.