Deadlock detection and recovery in Operating Systems - Mini Project: Build & Apply

Deadlock Detection and Recovery

📖 Scenario: Imagine a small computer system managing resources like printers and scanners. Sometimes, programs get stuck waiting for each other, causing a deadlock. We want to understand how to detect and recover from such deadlocks.

🎯 Goal: Build a simple model representing processes and resources, then apply deadlock detection logic and finally show how to recover by releasing resources.

📋 What You'll Learn

Create a data structure representing processes and their resource allocations

Set up a configuration variable for available resources

Implement deadlock detection logic by checking if processes can proceed

Add recovery steps to release resources from deadlocked processes

💡 Why This Matters

🌍 Real World

Operating systems must detect and recover from deadlocks to keep computers running smoothly without programs freezing.

💼 Career

Understanding deadlock detection and recovery is important for system administrators, software developers, and anyone working with concurrent systems or resource management.

1

DATA SETUP: Define processes and their resource allocations

Create a dictionary called processes with these exact entries: 'P1': {'allocated': 1, 'requested': 1}, 'P2': {'allocated': 2, 'requested': 0}, and 'P3': {'allocated': 1, 'requested': 2}.

Operating Systems

# Create the processes dictionary with allocated and requested resources
# Your code here

Need a hint?

Think of each process as having some resources already allocated and some resources it still requests.

2

CONFIGURATION: Define available resources

Create a variable called available_resources and set it to 2 to represent the number of free resources in the system.

Operating Systems

processes = {
    'P1': {'allocated': 1, 'requested': 1},
    'P2': {'allocated': 2, 'requested': 0},
    'P3': {'allocated': 1, 'requested': 2}
}

# Define available resources
# Your code here

Need a hint?

This variable shows how many resources are free to be allocated.

3

CORE LOGIC: Detect deadlocked processes

Create a list called deadlocked and use a for loop with variable proc to check each process in processes. Append proc to deadlocked if its requested resources are more than available_resources.

Operating Systems

processes = {
    'P1': {'allocated': 1, 'requested': 1},
    'P2': {'allocated': 2, 'requested': 0},
    'P3': {'allocated': 1, 'requested': 2}
}
available_resources = 2

# Detect deadlocked processes
# Your code here

Need a hint?

Check each process's requested resources against what is available to find those stuck waiting.

4

COMPLETION: Recover by releasing resources from deadlocked processes

Use a for loop with variable proc to iterate over deadlocked. For each, add its allocated resources back to available_resources and set its allocated and requested resources to 0 in processes.

Operating Systems

processes = {
    'P1': {'allocated': 1, 'requested': 1},
    'P2': {'allocated': 2, 'requested': 0},
    'P3': {'allocated': 1, 'requested': 2}
}
available_resources = 2

deadlocked = []
for proc in processes:
    if processes[proc]['requested'] > available_resources:
        deadlocked.append(proc)

# Recover from deadlock by releasing resources
# Your code here

Need a hint?

Free resources held by deadlocked processes to allow others to continue.