Deadlock avoidance (Banker's algorithm) in Operating Systems - Mini Project: Build & Apply

Deadlock Avoidance with Banker's Algorithm

📖 Scenario: You are managing resource allocation in a computer system to avoid deadlocks. You want to use the Banker's algorithm to check if the system is in a safe state before granting resource requests.

🎯 Goal: Build a step-by-step Banker's algorithm setup that models processes, resources, and checks for safe states to avoid deadlocks.

📋 What You'll Learn

Create data structures for processes, maximum resource needs, allocated resources, and available resources.

Define a variable to track the number of processes.

Implement the core logic to calculate the need matrix and check for a safe sequence.

Complete the setup by adding a final step to confirm the system's safe state.

💡 Why This Matters

🌍 Real World

Operating systems use the Banker's algorithm to avoid deadlocks by ensuring resource allocation keeps the system in a safe state.

💼 Career

Understanding deadlock avoidance is important for system administrators, OS developers, and anyone working with concurrent systems or resource management.

1

Set up initial resource allocation data

Create a dictionary called allocated with these exact entries: 0: [0, 1, 0], 1: [2, 0, 0], 2: [3, 0, 2], 3: [2, 1, 1], 4: [0, 0, 2]. Also create a dictionary called maximum with these exact entries: 0: [7, 5, 3], 1: [3, 2, 2], 2: [9, 0, 2], 3: [2, 2, 2], 4: [4, 3, 3]. Finally, create a list called available with the exact values [3, 3, 2].

Operating Systems

# Create allocated, maximum dictionaries and available list with exact values
# Your code here

Hint

Use dictionaries for allocated and maximum with process IDs as keys and lists of resource counts as values. Use a list for available.

2

Define the number of processes

Create a variable called num_processes and set it to the integer 5.

Operating Systems

allocated = {
    0: [0, 1, 0],
    1: [2, 0, 0],
    2: [3, 0, 2],
    3: [2, 1, 1],
    4: [0, 0, 2]
}
maximum = {
    0: [7, 5, 3],
    1: [3, 2, 2],
    2: [9, 0, 2],
    3: [2, 2, 2],
    4: [4, 3, 3]
}
available = [3, 3, 2]
# Create a variable num_processes and set it to 5
# Your code here

Hint

Count the number of processes from the dictionaries and assign it to num_processes.

3

Calculate the need matrix

Create a dictionary called need where each key is a process ID from 0 to 4, and the value is a list representing the difference between maximum and allocated resources for that process. Use a for loop with the variable i to iterate over the process IDs.

Operating Systems

allocated = {
    0: [0, 1, 0],
    1: [2, 0, 0],
    2: [3, 0, 2],
    3: [2, 1, 1],
    4: [0, 0, 2]
}
maximum = {
    0: [7, 5, 3],
    1: [3, 2, 2],
    2: [9, 0, 2],
    3: [2, 2, 2],
    4: [4, 3, 3]
}
available = [3, 3, 2]
num_processes = 5
# Calculate the need dictionary using a for loop with variable i
# Your code here

Hint

Use a dictionary comprehension inside the loop to subtract allocated from maximum for each resource.

4

Check for a safe sequence

Create a list called finish with False repeated num_processes times. Create a list called work as a copy of available. Use a while loop to find a process i where finish[i] is False and all elements in need[i] are less than or equal to corresponding elements in work. If found, add allocated[i] to work, set finish[i] to True. Repeat until no such process is found. This completes the Banker's algorithm safe state check.

Operating Systems

allocated = {
    0: [0, 1, 0],
    1: [2, 0, 0],
    2: [3, 0, 2],
    3: [2, 1, 1],
    4: [0, 0, 2]
}
maximum = {
    0: [7, 5, 3],
    1: [3, 2, 2],
    2: [9, 0, 2],
    3: [2, 2, 2],
    4: [4, 3, 3]
}
available = [3, 3, 2]
num_processes = 5
need = {}
for i in range(num_processes):
    need[i] = [maximum[i][j] - allocated[i][j] for j in range(len(available))]
# Add code to create finish list, work list, and implement the safe sequence check loop
# Your code here

Hint

Use a while loop with a flag variable found to repeat the search for a process that can finish safely.

Practice

1. What is the main purpose of the Banker's algorithm in operating systems?

easy

A. To increase CPU speed by optimizing instructions

B. To manage file storage on disk drives

C. To avoid deadlocks by checking if resource allocation is safe

D. To encrypt data for security purposes

Solution

1. Step 1: Understand the Banker's algorithm role

   The Banker's algorithm is designed to prevent deadlocks by simulating resource allocation and ensuring the system remains in a safe state.

2. Step 2: Compare options with the algorithm's purpose

   Only To avoid deadlocks by checking if resource allocation is safe correctly describes this purpose. Other options relate to unrelated system functions.

3. Final Answer:

   To avoid deadlocks by checking if resource allocation is safe -> Option C

4. Quick Check:

   Deadlock avoidance = Checking safe resource allocation [OK]

Hint: Banker's algorithm checks safety before granting resources [OK]

Common Mistakes:

• Confusing deadlock avoidance with performance optimization
• Thinking it manages storage or security
• Assuming it works after deadlock occurs

2. Which of the following is a required input for the Banker's algorithm to work correctly?

easy

A. The total CPU time each process will use

B. The maximum resource needs of each process

C. The size of the hard disk

D. The network bandwidth available

Solution

1. Step 1: Identify inputs needed by Banker's algorithm

   The algorithm requires the maximum resource needs of each process to predict safe allocation.

2. Step 2: Eliminate unrelated options

   CPU time, disk size, and network bandwidth are not inputs for this algorithm.

3. Final Answer:

   The maximum resource needs of each process -> Option B

4. Quick Check:

   Max resource needs = Required input [OK]

Hint: Know max needs to predict safe resource allocation [OK]

Common Mistakes:

• Confusing CPU time with resource needs
• Including unrelated system metrics
• Ignoring maximum resource requirements

3. Given the following data for three processes (P1, P2, P3) and one resource type with 10 units total:
Allocation: P1=3, P2=2, P3=2
Maximum: P1=7, P2=4, P3=3
Available: 1 unit
Which process can safely get its requested resources without causing deadlock?

medium

A. P1, because it needs 4 more units which are available

B. P2, because it needs 2 more units which are available

C. None, because available units are insufficient

D. P3, because it needs 1 more unit which is available

Solution

1. Step 1: Calculate each process's remaining need

   Need = Maximum - Allocation
   P1: 7-3=4 units
   P2: 4-2=2 units
   P3: 3-2=1 unit

2. Step 2: Compare needs with available units

   Available units = 1
   P1 needs 4 (not available)
   P2 needs 2 (not available)
   P3 needs 1 (available)
   Only P3 can be satisfied immediately, finishing first and releasing resources safely.

3. Final Answer:

   P3, because it needs 1 more unit which is available -> Option D

4. Quick Check:

   Need ≤ Available means safe allocation [OK]

Hint: Check need = max - allocation; compare with available [OK]

Common Mistakes:

• Miscalculating which process's need ≤ available
• Choosing process with higher need incorrectly
• Confusing allocation with need

4. A system using the Banker's algorithm has the following state:
Allocation: P1=1, P2=2
Maximum: P1=3, P2=3
Available: 1 unit
If process P1 requests 2 more units, what is the correct action?

medium

A. Deny the request to avoid unsafe state

B. Grant the request immediately

C. Ignore the request and continue

D. Increase available units to grant request

Solution

1. Step 1: Calculate P1's need and check availability

   P1's need = Maximum - Allocation = 3 - 1 = 2 units
   Available units = 1
   P1 requests 2 units, but only 1 is available.

2. Step 2: Determine if granting request is safe

   Granting 2 units is impossible now; it would cause an unsafe state or deadlock.
   Therefore, the request must be denied.

3. Final Answer:

   Deny the request to avoid unsafe state -> Option A

4. Quick Check:

   Request > Available means deny [OK]

Hint: Deny requests exceeding available resources [OK]

Common Mistakes:

• Granting requests without checking availability
• Ignoring unsafe states
• Assuming system can create resources

5. Consider a system with 3 processes (P1, P2, P3) and 2 resource types (R1 and R2).
Maximum needs:
P1: (7, 5), P2: (3, 2), P3: (9, 0)
Current allocation:
P1: (3, 2), P2: (2, 1), P3: (3, 0)
Available resources: (3, 2)
If P2 requests (1, 1), should the Banker's algorithm grant it? Why or why not?

hard

A. Yes, because granting keeps system in a safe state

B. No, because P2's request exceeds its maximum need

C. No, because granting leads to an unsafe state

D. Yes, because available resources are sufficient

Solution

1. Step 1: Check if request exceeds maximum need

   P2's maximum need = (3, 2)
   Current allocation = (2, 1)
   Request = (1, 1)
   New allocation would be (3, 2), which equals maximum need, so request is valid.

2. Step 2: Check if available resources can satisfy request and system remains safe

   Available = (3, 2)
   Request = (1, 1) ≤ Available, so resources are sufficient.
   After granting, Available becomes (2, 1).
   Check if system can finish all processes:
   - P1 needs (7-3, 5-2) = (4, 3)
   - P2 needs (3-3, 2-2) = (0, 0)
   - P3 needs (9-3, 0-0) = (6, 0)
   P2 can finish immediately, releasing (3, 2) back.
   Then Available becomes (5, 3), enough for P1 and P3 to finish.
   System is safe.

3. Final Answer:

   Yes, because granting keeps system in a safe state -> Option A

4. Quick Check:

   Request ≤ Max and safe state = Grant [OK]

Hint: Grant if request ≤ max and system stays safe after allocation [OK]

Common Mistakes:

• Denying valid requests due to misunderstanding max need
• Ignoring safety check after allocation
• Assuming available resources alone decide grant