Resource allocation graph in Operating Systems - Time & Space Complexity

Time Complexity: Resource allocation graph

O(V + E)

Understanding Time Complexity

We want to understand how the time to analyze a resource allocation graph changes as the system grows.

Specifically, how does checking for deadlocks scale with more processes and resources?

Scenario Under Consideration

Analyze the time complexity of detecting a cycle in a resource allocation graph.

function detectCycle(graph):
  visited = set()
  recursionStack = set()

  for node in graph.nodes:
    if node not in visited:
      if dfs(node, visited, recursionStack, graph):
        return true
  return false

function dfs(node, visited, recursionStack, graph):
  visited.add(node)
  recursionStack.add(node)
  for neighbor in graph.adjacent(node):
    if neighbor not in visited:
      if dfs(neighbor, visited, recursionStack, graph):
        return true
    elif neighbor in recursionStack:
      return true
  recursionStack.remove(node)
  return false

This code checks if there is a cycle in the graph, which indicates a deadlock.

Identify Repeating Operations

Look for loops and recursive calls that repeat work.

• Primary operation: Depth-first search (DFS) visits each node and its edges.
• How many times: Each node and edge is visited once during DFS.

How Execution Grows With Input

As the number of processes and resources (nodes) and their connections (edges) grow, the time to check for cycles grows roughly in proportion.

Input Size (nodes + edges)	Approx. Operations
10	About 10 to 20 visits
100	About 100 to 200 visits
1000	About 1000 to 2000 visits

Pattern observation: The work grows roughly linearly with the total number of nodes and edges.

Final Time Complexity

Time Complexity: O(V + E)

This means the time to detect deadlocks grows in a straight line with the number of processes and resource connections.

Common Mistake

[X] Wrong: "Checking for deadlocks takes the same time no matter how many processes or resources there are."

[OK] Correct: The more processes and resources you have, the more connections to check, so it takes more time.

Interview Connect

Understanding how cycle detection scales helps you explain system behavior and resource management clearly in interviews.

Self-Check

"What if the graph was represented as an adjacency matrix instead of adjacency lists? How would the time complexity change?"

Practice

1. What does a resource allocation graph primarily represent in an operating system?

easy

A. The network connections between computers

B. The file system hierarchy of the operating system

C. The relationship between processes and the resources they hold or request

D. The CPU scheduling order of processes

Solution

1. Step 1: Understand the purpose of resource allocation graphs

   Resource allocation graphs show which processes hold resources and which are waiting for them.

2. Step 2: Compare with other options

   File systems, network connections, and CPU scheduling are unrelated to resource allocation graphs.

3. Final Answer:

   The relationship between processes and the resources they hold or request -> Option C

4. Quick Check:

   Resource allocation graph = process-resource relationships [OK]

Hint: Focus on process-resource connections, not unrelated system parts [OK]

Common Mistakes:

• Confusing resource allocation graph with file system structure
• Thinking it shows network or CPU scheduling details

2. Which of the following correctly represents an edge from a process to a resource in a resource allocation graph?

easy

A. An arrow from the process node to the resource node

B. An arrow from the resource node to the process node

C. A double-headed arrow between process and resource nodes

D. No arrow, just a line connecting process and resource

Solution

1. Step 1: Recall edge direction meanings

   An arrow from a process to a resource means the process is requesting that resource.

2. Step 2: Eliminate incorrect options

   Arrow from resource to process means resource is allocated; double-headed or no arrow are incorrect representations.

3. Final Answer:

   An arrow from the process node to the resource node -> Option A

4. Quick Check:

   Process to resource = request edge [OK]

Hint: Process to resource arrow means request; resource to process means allocation [OK]

Common Mistakes:

• Reversing arrow directions for request and allocation
• Assuming no arrows are used

3. Consider a resource allocation graph with processes P1, P2 and resources R1, R2. P1 holds R1 and requests R2. P2 holds R2 and requests R1. What does this graph indicate?

medium

A. Deadlock exists between P1 and P2

B. Only P2 is deadlocked

C. Only P1 is deadlocked

D. No deadlock, processes can proceed

Solution

1. Step 1: Identify the cycle in the graph

   P1 holds R1 and waits for R2; P2 holds R2 and waits for R1, forming a cycle.

2. Step 2: Understand cycle implication

   A cycle in a resource allocation graph means deadlock among involved processes.

3. Final Answer:

   Deadlock exists between P1 and P2 -> Option A

4. Quick Check:

   Cycle in graph = deadlock [OK]

Hint: Look for cycles to detect deadlocks quickly [OK]

Common Mistakes:

• Ignoring the cycle and assuming no deadlock
• Thinking only one process is deadlocked

4. A resource allocation graph shows a cycle involving three processes and three resources. Which of the following fixes the deadlock?

medium

A. Remove all edges from resources to processes

B. Remove one edge from a process to a resource in the cycle

C. Add more edges to connect all processes

D. Ignore the cycle; it will resolve automatically

Solution

1. Step 1: Understand deadlock resolution in resource allocation graphs

   Removing an edge in the cycle breaks the cycle and resolves deadlock.

2. Step 2: Evaluate other options

   Adding edges or removing all edges from resources to processes does not fix deadlock; ignoring it is unsafe.

3. Final Answer:

   Remove one edge from a process to a resource in the cycle -> Option B

4. Quick Check:

   Break cycle by removing an edge [OK]

Hint: Break cycles by removing one request edge [OK]

Common Mistakes:

• Adding edges instead of removing
• Ignoring deadlock cycles

5. In a system with multiple processes and resources, how can a resource allocation graph help the operating system avoid deadlocks?

hard

A. By ignoring resource requests to reduce complexity

B. By increasing CPU speed to finish processes faster

C. By randomly killing processes to free resources

D. By detecting cycles early and preventing resource allocation that causes them

Solution

1. Step 1: Understand the role of resource allocation graphs

   They help detect cycles that indicate deadlocks before they happen.

2. Step 2: How OS uses this information

   The OS can prevent granting resource requests that would create cycles, thus avoiding deadlocks.

3. Final Answer:

   By detecting cycles early and preventing resource allocation that causes them -> Option D

4. Quick Check:

   Cycle detection prevents deadlocks [OK]

Hint: Prevent cycles by denying risky resource requests [OK]

Common Mistakes:

• Thinking CPU speed affects deadlocks
• Assuming random process termination is a solution
• Ignoring resource requests is not practical