Deadlock detection and recovery in Operating Systems - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a deadlock in operating systems?

A deadlock is a situation where a group of processes are each waiting for resources held by the others, so none can proceed.

beginner

What is the main goal of deadlock detection?

The main goal of deadlock detection is to find if a deadlock has occurred in the system by checking resource allocation and process states.

intermediate

Name one common method used for deadlock detection.

One common method is the resource allocation graph, which shows processes and resources and helps identify cycles indicating deadlocks.

intermediate

What are two common strategies for deadlock recovery?

Two common strategies are: 1) Terminating one or more processes involved in the deadlock, 2) Preempting resources from some processes to break the deadlock.

intermediate

Why is deadlock prevention often not used in practice?

Deadlock prevention can be too restrictive and reduce system efficiency because it limits how resources are allocated.

What does a cycle in a resource allocation graph indicate?

A A deadlock

B A free resource

C A completed process

D An idle CPU

A cycle in the resource allocation graph means processes are waiting on each other in a loop, which is a deadlock.

Which of the following is NOT a deadlock recovery method?

A Rolling back processes

B Preempting resources

C Terminating processes

D Ignoring the deadlock

Ignoring the deadlock does not recover from it; recovery requires active steps like termination or preemption.

Deadlock detection algorithms typically run:

A Only at system startup

B Periodically during system operation

C Only when a process finishes

D Never

Deadlock detection algorithms run periodically to check if deadlocks have occurred.

Which resource state is most likely to cause deadlock?

A Resources held and requested simultaneously by processes

B Resources always free

C Resources never requested

D Resources allocated to only one process

Deadlocks happen when processes hold resources and wait for others held by other processes.

What is a disadvantage of terminating processes to recover from deadlock?

A It prevents deadlocks from happening

B It speeds up the system

C It may cause loss of work done by the terminated processes

D It frees all resources immediately

Terminating processes can cause loss of progress and data from those processes.

Explain how deadlock detection works and what happens after a deadlock is detected.

Think about how the system finds deadlocks and what it does next.

Describe two methods used to recover from deadlocks and their possible drawbacks.

Consider what happens when you stop or take resources from processes.

Practice

1. What is the main purpose of deadlock detection in operating systems?

easy

A. To find when programs are stuck waiting forever

B. To speed up program execution

C. To allocate more memory to programs

D. To prevent viruses from entering the system

Solution

1. Step 1: Understand deadlock concept

   Deadlock happens when programs wait forever for resources held by each other.

2. Step 2: Identify deadlock detection role

   Deadlock detection finds these stuck programs so the system can fix the problem.

3. Final Answer:

   To find when programs are stuck waiting forever -> Option A

4. Quick Check:

   Deadlock detection = find stuck programs [OK]

Hint: Deadlock detection means finding stuck programs [OK]

Common Mistakes:

• Confusing detection with prevention
• Thinking it speeds up programs
• Mixing with security tasks

2. Which of the following is a correct method used in deadlock recovery?

easy

A. Terminating one or more processes

B. Encrypting data

C. Adding more RAM

D. Increasing CPU speed

Solution

1. Step 1: Review deadlock recovery methods

   Recovery fixes deadlocks by freeing resources or stopping processes causing the deadlock.

2. Step 2: Match options to recovery methods

   Terminating processes is a common way to break deadlocks by releasing resources.

3. Final Answer:

   Terminating one or more processes -> Option A

4. Quick Check:

   Recovery = stop processes to free resources [OK]

Hint: Recovery often stops processes to free resources [OK]

Common Mistakes:

• Thinking hardware upgrades fix deadlocks
• Confusing recovery with detection
• Believing encryption helps deadlocks

3. Consider a system with three processes P1, P2, P3 and resources R1, R2. If P1 holds R1 and waits for R2, P2 holds R2 and waits for R1, and P3 is idle, what does deadlock detection report?

medium

A. No deadlock detected

B. Deadlock involving P2 and P3

C. Deadlock involving P1 and P2

D. Deadlock involving all three processes

Solution

1. Step 1: Analyze resource holding and waiting

   P1 holds R1 and waits for R2; P2 holds R2 and waits for R1; P3 is idle (not waiting).

2. Step 2: Identify circular wait

   P1 and P2 are waiting on each other's resources, forming a cycle causing deadlock; P3 is not involved.

3. Final Answer:

   Deadlock involving P1 and P2 -> Option C

4. Quick Check:

   Circular wait between P1 and P2 = deadlock [OK]

Hint: Look for circular waiting processes [OK]

Common Mistakes:

• Including idle processes in deadlock
• Ignoring circular wait condition
• Assuming no deadlock if one process is idle

4. A system uses a deadlock detection algorithm but never recovers from deadlocks. What is the main problem with this approach?

medium

A. Deadlocks will be prevented automatically

B. Deadlocks will never be found

C. System will run faster

D. System will detect deadlocks but remain stuck

Solution

1. Step 1: Understand detection without recovery

   Detection finds deadlocks but does not fix them if recovery is missing.

2. Step 2: Identify system behavior

   The system will know deadlocks exist but processes remain stuck, causing hang or freeze.

3. Final Answer:

   System will detect deadlocks but remain stuck -> Option D

4. Quick Check:

   Detection alone = find deadlock, no fix [OK]

Hint: Detection finds; recovery fixes deadlocks [OK]

Common Mistakes:

• Thinking detection prevents deadlocks
• Assuming system runs faster without recovery
• Believing deadlocks won't be found

5. In a system with multiple processes and resources, which strategy best combines deadlock detection and recovery to maintain system fairness and efficiency?

hard

A. Prevent deadlocks by denying all resource requests

B. Detect deadlocks periodically and terminate the process holding the most resources

C. Ignore deadlocks and restart the system when it freezes

D. Allow deadlocks and manually fix them later

Solution

1. Step 1: Understand combined detection and recovery

   Detecting deadlocks periodically helps find problems early; recovering by terminating processes frees resources.

2. Step 2: Evaluate options for fairness and efficiency

   Terminating the process holding most resources frees maximum resources, improving system efficiency and fairness.

3. Final Answer:

   Detect deadlocks periodically and terminate the process holding the most resources -> Option B

4. Quick Check:

   Periodic detection + smart recovery = fairness and efficiency [OK]

Hint: Detect often; recover by freeing max resources [OK]

Common Mistakes:

• Preventing all requests reduces efficiency
• Ignoring deadlocks causes system freeze
• Manual fixes delay problem resolution