For the Resource Allocation Graph shown in Figure 1, answer the following questions: R1 R2 P1 PO P2 P3 R3 Figure 1: Resource Allocation Graph 1. Find if the system in Figure 1, is in a deadlock state, otherwise find a safe sequence. II. Assume now that P2 also requests resource R1. Will the system be in a deadlock state? If not, find a safe sequence.

For the Resource Allocation Graph shown in Figure 1, answer the following questions: R1 R2 P1 PO P2 P3 R3 Figure 1: Resource Allocation Graph 1. Find if the system in Figure 1, is in a deadlock state, otherwise find a safe sequence. II. Assume now that P2 also requests resource R1. Will the system be in a deadlock state? If not, find a safe sequence.

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

See similar textbooks

Similar questions

possible Consider the resource allocation graph in the following figure. Show cycles in the graph, if exist. Also find if the system is in a deadlock state or not. Justify your answer. Also convert this resource allocation graph into wait for graph. R1 R2 PO P2 P3 R3
In the resource-Allocation graph, there is a possibility of deadlock?
Q.No.4: Draw a Resource Allocation Graph (RAG) for a given scenario and find that whether it contains a deadlock or not. Find all cycles in the RAG. Resources: Printer (R1), Hard Disk (R2), CPU (R3) and RAM (R4) Processes: MS Excel (P1), MS Word (P2), Media Player (P3) and Calculator (P4) · Resources: Printer = 1, Hard Disks = 2, CPU = 1, RAM = 1 · MS Excel Holds Printer and wait for CPU and RAM. · MS Word holds Hard Disk and RAM and waits for Printer and CPU. · Media Player waits for Hard Disk. · Calculator holds CPU. Write cycles in RAG if any?
A set of waiting processes P0, P1, Pn must exist, with P0 waiting for a resource held by P1, P1 waiting for a resource held by P2,..., Pn-1 waiting for a resource held by Pn, and Pn waiting for a resource held by P0. The term "deadlock" is used to describe this situation.
Q4. For the system with state as given below using resource allocation graph, find out if there is a deadlock. List all the deadlocked processes(if any). Process-ID Allocated Resources Requested Resources Ро 1,2 P1 3,4 P2 6. P3 10 Р4 P5 8 6. P6 P7 10,11,12 4,5 Q5. What do you understand by deadlock avoidance? Using banker's algorithm check if the system with state given below is in safe or unsafe state.(Maximum Printers: 12) Process-ID Maximum Need Current Allocation Current Need Ро 7. 2 P1 2 1 1 P2 8 4 4 P3 P4 1 2 12 1 11 P5 6. 8
Consider a system with five processes and three resource type. Resource type X has 7 instances, resource type Y has 10 instances and resource type Z has 5 instances. Suppose that at time 0, the following snapshot of the system has been taken. Suppose B request 2 additional instances of resource type X and 1 instance for resource type Y, can the request be granted? Is the system safe? If yes, what is the safe sequence?
Consider a system consisting of four processes and a single resource. The total resource before any allocation occurs is 20. The current state of the claim vector is C = (3, 2, 8, 6) and the allocation vector is A = (1, 1, 3, 2). If "Process Initiation Denial" is used as the Deadlock Avoidance policy, should a new process with 2 maximum claim be initiated? O Yes O No
Consider the following resource allocation graph, does deadlock exist due to circular waiting {enter yes or no} Yes ? If no, are any process(es) deadlocked other than circular waiting {note, enter W,X,Y,Z for any/all processes that are deadlocked, or none} ? If yes, which process(es) is/are not deadlocked due to circular waiting (or none) {note, enter W,X,Y,Z for any/all processes that are deadlocked, or none}? A R1 B R2 C R3
Suppose there are two Processes B1 and B2. There is one instance of Resource R1 and two instances of R2. • 81 holds Resource R1 and requesting for Resource R2. • B2 holds Resource R2 and requesting for Resource R1. Consider the scenario in terms of Deadlocks. You may consider drawing a Resource Allocation Graph for the above scenario. (No Upload.Only write answers for a) and b) in the box given below) a) What kind of situation does the graph shows (Deadlock or No Deadlock)? b) Justify(reason) your answer to question (a). A- B I
M6
Consider a system with five processes and three resource type. Resource type X has 7 instances, resource type Y has 10 instances and resource type Z has 5 instances. Suppose that at time 0, the following snapshot of the system has been taken. Is the process safe? If yes, what is the safe sequence? If not, which process is unsafe?
Using a resource allocation graph, show the possibility of a deadlock in this implementation. Modify the order of some of the get requests to prevent the possibility of any deadlock. Is it possible that a resource deadlock involves multiple units of one type and a single unit of another? If so, give an example.