from MODERN OPERATING SYSTEMS FOURTH EDITION by Andrew S. Tanenbaum 14. Consider the following state of a system with four processes, P1, P2, P3, and P4, andfive types of resources, RS1, RS2, RS3, RS4, and RS5:0|1|11 21 |0 2 |10 1|00 1 0 21E = (24144)C =00|00|1R =0 2 0 31A = (01021)2 10|00 2 |1Using the deadlock detection algorithm described in Section 6.4.2, show that there is adeadlock in the system. Identify the processes that are deadlocked.

14. Consider the following state of a system with four processes, P1, P2, P3, and P4, and five types of resources, RS1, RS2, RS3, RS4, and RS5: 0|1|112 1 1 0 2 1 0 1 |0 2 1 01 C = 010 E = (24144) 0|0 R = 0 2 0 |3 1 A = (01021) 2 |1|00| 0 0 2 1|1 0 Using the deadlock detection algorithm described in Section 6.4.2, show that there is a deadlock in the system. Identify the processes that are deadlocked.

14. Consider the following state of a system with four processes, P1, P2, P3, and P4, and five types of resources, RS1, RS2, RS3, RS4, and RS5: 0|1|112 1 1 0 2 1 0 1 |0 2 1 01 C = 010 E = (24144) 0|0 R = 0 2 0 |3 1 A = (01021) 2 |1|00| 0 0 2 1|1 0 Using the deadlock detection algorithm described in Section 6.4.2, show that there is a deadlock in the system. Identify the processes that are deadlocked.

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 computer system which has four identical units of a resource R. There are three processes each with a maximum claim of two units of resource R. Processes can request these resources in any way that is, two in one shot or one by one. The system always satisfies a request for a resource if enough resources are available. If the processes don't request any other kind of resource, show that the system never deadlocks?
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?
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…
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?
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 the system with 5 processes <P0, P1, P2, P3, P4> and three resources types (4)A=13, B=13 and C=9. The following information has been attached.
Consider a system consisting of m resources of the same type being shared by n processes, n > m. Each process has a maximum need of m/2 resources. Initially, each process has no resource requests. A process can request or release only one resource at a time. With n=3k and m=2k, for some integer k, show that the system is deadlock free.
List/explain 3 different ways that a system can recover from deadlock. Know the necessary conditions for deadlock and explanations of each. Why is it necessary to have an atomic instructions for providing access to a critical section? Consider a system with 5 processes (A, B, C, D and E) and 5 single instances of resources (Q, R, S, T, U) with given assignments (A holds R and wants T, C holds T and wants Q, etc). Construct a resource allocation graph. Determine if deadlock occurred. Draw a wait-for graph of the system. It's a C Programming
Consider a system consisting of six resources of the same type that are shared by four processes, each of which needs at most three resources. Show that the system is deadlock free.
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?
Suppose that a multiprogrammed system has a load of N processes with individual execution times of t1, t2, ...,tN. Answer the following questions: a) How would it be possible that the time to complete the N processes could be as small as: maximum (t1, t2, ...,tN)? b) How would it be possible that the total execution time, T > t1+ t2+ ...+tN? In other words, what would cause the total execution time to exceed the sum of individual process execution times?
8. Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of 'm' that ensures that deadlock will never occur is a. 11 b. 12 c. 13 d. 14