Consider a system employing a deadlock-avoidance scheme based on pre-declaration of resource needs for various processes. In particular, the resource needs of the processes are represented by claim arcs in the resource-allocation graph. Whenever a resource request by a process is issued, it is rejected by the system if the newly formed allocation arc (from the resource vertex to the process vertex) replacing the corresponding claim arc (from the process vertex to the resource vertex) closes a cycle in the resource-allocation graph. Otherwise, the system grants the request and converts the claim arc to the allocation arc in the resource-allocation graph. Let P1, P2 and P3 be three processes in the system. Let P1 declare that it may request resources W, X and Y; P2 declare that it may request resources X, Y and Z; P3 declare that it may request resources W, Y and Z. Construct the resource-allocation graph with the appropriate claim arcs. Consider each of the following pairs of resource requests. Based on the resource-allocation graph constructed above, identify the pair of requests among the following that can be granted without a deadlock possibility? A. P1 requesting Y and P3 requesting W B. P1 requesting W and P3 requesting Y C. P1 requesting X and P2 requesting Z D. P1 requesting X and P2 requesting Y
Consider a system employing a deadlock-avoidance scheme based on pre-declaration of resource needs for various processes. In particular, the resource needs of the processes are represented by claim arcs in the resource-allocation graph. Whenever a resource request by a process is issued, it is rejected by the system if the newly formed allocation arc (from the resource vertex to the process vertex) replacing the corresponding claim arc (from the process vertex to the resource vertex) closes a cycle in the resource-allocation graph. Otherwise, the system grants the request and converts the claim arc to the allocation arc in the resource-allocation graph. Let P1, P2 and P3 be three processes in the system. Let P1 declare that it may request resources W, X and Y; P2 declare that it may request resources X, Y and Z; P3 declare that it may request resources W, Y and Z. Construct the resource-allocation graph with the appropriate claim arcs. Consider each of the following pairs of resource requests. Based on the resource-allocation graph constructed above, identify the pair of requests among the following that can be granted without a deadlock possibility? A. P1 requesting Y and P3 requesting W B. P1 requesting W and P3 requesting Y C. P1 requesting X and P2 requesting Z D. P1 requesting X and P2 requesting Y
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
Related questions
Question
Don't use ai to answer I will report you answer
Transcribed Image Text:Consider a system employing a deadlock-avoidance scheme based on pre-declaration of
resource needs for various processes. In particular, the resource needs of the processes are
represented by claim arcs in the resource-allocation graph. Whenever a resource request by a
process is issued, it is rejected by the system if the newly formed allocation arc (from the resource
vertex to the process vertex) replacing the corresponding claim arc (from the process vertex to the
resource vertex) closes a cycle in the resource-allocation graph. Otherwise, the system grants the
request and converts the claim arc to the allocation arc in the resource-allocation graph.
Let P1, P2 and P3 be three processes in the system. Let P1 declare that it may request resources
W, X and Y; P2 declare that it may request resources X, Y and Z; P3 declare that it may request
resources W, Y and Z. Construct the resource-allocation graph with the appropriate claim arcs.
Consider each of the following pairs of resource requests. Based on the resource-allocation graph
constructed above, identify the pair of requests among the following that can be granted without
a deadlock possibility?
A. P1 requesting Y and P3 requesting W
B. P1 requesting W and P3 requesting Y
C. P1 requesting X and P2 requesting Z
D. P1 requesting X and P2 requesting Y
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education