In the resource allocation graph below the letters A, B,..., I represent processes while numbers 1, 2,..., 9 represent resources. An arrow going from a resource to a process means that the process holds the resource. F 2 3 B 6 9 (E) 7 4 H 8 (a) Find all processes (in the graph above) which are in a deadlock. (b) We may kill one or more processes to break the deadlock. Which process should be killed? (c) Assume that there are four processes labeled A, B, C, D and four resources labeled 1, 2, 3, 4. Draw the resource allocation graph for the following sequence of requests. (The resource is assigned to the first process that requested it.) process B requests resource 2; process C requests resource 1; process A requests resource 2; process C requests resource 4; ⚫process A requests resource 3; ⚫process D requests resource 4; ⚫process B requests resource 3; process D requests resource 1. Which of the above processes are in a deadlock? Justify your answer.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
In the resource allocation graph below the letters A, B,..., I represent processes while
numbers 1, 2,..., 9 represent resources. An arrow going from a resource to a process
means that the process holds the resource.
F
2
3
B
6
9 (E)
7
4
H
8
(a) Find all processes (in the graph above) which are in a deadlock.
(b) We may kill one or more processes to break the deadlock. Which process should be
killed?
(c) Assume that there are four processes labeled A, B, C, D and four resources labeled
1, 2, 3, 4. Draw the resource allocation graph for the following sequence of requests.
(The resource is assigned to the first process that requested it.)
process B requests resource 2;
process C requests resource 1;
process A requests resource 2;
process C requests resource 4;
⚫process A requests resource 3;
⚫process D requests resource 4;
⚫process B requests resource 3;
process D requests resource 1.
Which of the above processes are in a deadlock? Justify your answer.
Transcribed Image Text:In the resource allocation graph below the letters A, B,..., I represent processes while numbers 1, 2,..., 9 represent resources. An arrow going from a resource to a process means that the process holds the resource. F 2 3 B 6 9 (E) 7 4 H 8 (a) Find all processes (in the graph above) which are in a deadlock. (b) We may kill one or more processes to break the deadlock. Which process should be killed? (c) Assume that there are four processes labeled A, B, C, D and four resources labeled 1, 2, 3, 4. Draw the resource allocation graph for the following sequence of requests. (The resource is assigned to the first process that requested it.) process B requests resource 2; process C requests resource 1; process A requests resource 2; process C requests resource 4; ⚫process A requests resource 3; ⚫process D requests resource 4; ⚫process B requests resource 3; process D requests resource 1. Which of the above processes are in a deadlock? Justify your answer.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education