Consider that there are Four process named as P1, P2, P3 and P4 with the six different resources R1, R2, R3, R4, R5 and R6. R1, R2, R3 has only one instance, R4 has three instances, R5 has two instance and R6 has three instances. Process P1 is holding the resources R1, R4, R5 and requesting the resource R2. Process P2 is holding the resources RS and requesting the resource R2. Process P3 is holding the resources R2, R3 and requesting the resource R5. Process P4 is holding the resource R6 and requesting the resource R3. Draw the resource allocation algorithm based on the given instruction and identify whether a deadlock case is existing or not.

Consider that there are Four process named as P1, P2, P3 and P4 with the six different resources R1, R2, R3, R4, R5 and R6. R1, R2, R3 has only one instance, R4 has three instances, R5 has two instance and R6 has three instances. Process P1 is holding the resources R1, R4, R5 and requesting the resource R2. Process P2 is holding the resources RS and requesting the resource R2. Process P3 is holding the resources R2, R3 and requesting the resource R5. Process P4 is holding the resource R6 and requesting the resource R3. Draw the resource allocation algorithm based on the given instruction and identify whether a deadlock case is existing or not.

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

Consider a system with three processes (P1, P2, and P3) and four resources (R1 has one instance, R2 has two instances, R3 has one instance, and R4 has three instances). The Snapshot at time Tx has the following situation: P1 holds one instance from Resource R2 and Request Resource R1 P2 holds Resource R1, one instance from Resource R2 and Request Resource R3 P3 holds Resource R3 and Request one instance from Resource R2 Draw the Resource Allocation Graph, then check if the system in safe state or not? If yes? What is the safe sequence?
Suppose a system has 5 processes, P = {P1, P2, P3, P4, P5}, and 4 resources, R = {R1, R2, R3, R4}, where there are 2 instances of R1, 1 instance of R2, 3 instances of R3, and 3 instances of R4. The current state of the system is defined by the following requests and assignments: P1 is requesting an instance of R3 and has been assigned an instance of R2; P2 is requesting an instance of R1 and has been assigned an instance of R3; P3 is requesting an instance of R4 and has been assigned an instance of R1 and an instance of R3; P4 is requesting an instance of R3; P5 is requesting an instance of R2 and has been assigned an instance of R4. Is there deadlock in this system? (Explicitly state yes, there’s deadlock or no, there isn’t.) If applicable, draw a wait-for graph or resource-allocation graph, and use the appropriate graph to justify your answer. If you conclude there is no deadlock, your justification should contain a sequence of execution for the processes which shows that…
A system has three processes (P1, P2, P3) and three reusable resources (R1, R2, R3). There is one instance of R1, two instances of R2 and three instances of R3. P1 holds an R1 and an R3 and is requesting an R2. P2 holds an R3 and is requesting an R1 and an R2. P3 holds two R2 and an R3 and is requesting an R1. How many cycles are there? Does a deadlokc exist? Why?
A deadlock occurs when a group of processes is stalled because one process is holding a resource and waiting for another process to obtain it. Consider the situation when two trains are approaching each other on the same track and there is only one track: once they are in front of each other, neither train can proceed. In operating systems, a similar scenario happens when two or more processes possess certain resources while waiting on resources owned by other processes (s). In the picture below, Process 1 is holding Resource 1 and waiting for Process 2 to acquire Resource 2, while Process 2 is waiting for Resource 1. Give an example of a realistic deadlock avoidance approach and describe the basic strategy behind it.
Suppose at time T0, following is the snapshot of a system with 6 process (P0, P1, P2, P3, P4, P5) and 3 resources (A, B, C) having 8, 10 and 12 instances respectively.Allocation Max A B C A B CP0 2 3 1 4 4 4P1 1 0 3 3 3 3P2 0 2 2 1 2 3P3 1 2 1 2 2 2P4 0 2 1 0 3 5P5 2 0 2 2 1 2Now, if process P4 make a new request (0, 1, 2) for resources then state that whether this request can be granted or not using Banker’s Algorithm.
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?
4. With a single resource, deadlock occurs a. if there are more than two processes competing for that resource b. if there are only two processes competing for that resource c. if there is a single process competing for that resource d. none of these
Question 4 Execute SRT for the following group of processes and complete the following table: Process A B C D E TArrival 0 2 4 6 8 Ts 2 3 5 1 4 TFinish Answer Answer Answer Answer Answer TR Answer Â Answer Â Answer Â Answer Â Answer Â 1. If the process arriving has the same remaining execution time as the process in the CPU, then the process that is using the CPU will have the highest priority.Â 2. If there is no process in the execution state and two or more processes have the shortest remaining time, then you will use the lowest PID criterion (using lexicographical order). Question 5 Execute HRRN for the following group of processes and complete the following table: Process A B C D TArrival 0 2 4 6 Ts 3 5 4 1 TFinish Answer Answer Answer Answer TR Answer Â Answer Answer Answer Â If two or more processes in the ready queue…
In the event of an impasse, it becomes necessary to terminate said processes, thereby leading to the subsequent consequences:
Process P0 and process P1 both want to access a shared datum, X, which is currently 0. P0 wants to add 2 to it, P1 wants to add 3 to it. Answer the following.a. Without synchronization, what value(s) can X result in?b. With synchronization, what value(s) can X result in?c. If another process, P2, was supposed to access X after P0 and P1 completed their stores, where P2 sets X to 5, would your answer to a or b change?
Consider a computer system with 3 processes and one resource with 4 instances. Each process needs at most 2 resource instances. Is a deadlock possible in this system? Justify your answer.
assume a system has 6 identical resources and N processes competing for them. each process can request at most 2 resources. what is the maximum value of N for the system to be deadlock free?