In the resource allocation graph below the letters A, B,..., G 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. 6 Α) 8 3 1 E (G) 4 9 2 F 7 D 5 B (a) Find all processes (in the graph above) which are in a deadlock. (b) What if we kill process D? Which processes are in a deadlock after that action? (c) Assume that there are only three processes labeled A, B, C and three resources labeled 1,2,3. Draw the resource allocation graph for the following sequence of requests: process A requests resource 1; process C requests resource 2; • process B requests resource 1; process A requests resource 2; process B requests resource 3; process C requests resource 3. Which of the above processes are in a deadlock? Justify your answer.

In the resource allocation graph below the letters A, B,..., G 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. 6 Α) 8 3 1 E (G) 4 9 2 F 7 D 5 B (a) Find all processes (in the graph above) which are in a deadlock. (b) What if we kill process D? Which processes are in a deadlock after that action? (c) Assume that there are only three processes labeled A, B, C and three resources labeled 1,2,3. Draw the resource allocation graph for the following sequence of requests: process A requests resource 1; process C requests resource 2; • process B requests resource 1; process A requests resource 2; process B requests resource 3; process C requests resource 3. 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

See similar textbooks

Similar questions

A system has three processes (P1,P2, P3) and three resources (R1,R2, R3). There is one instance of R1 and R2. There are three instances of R3. P1 holds an R1 and is requesting an R3. P2 holds an R3 and is requesting an R1. P3 holds two instances of R3 and an R2. Does a deadlock exist? Justify your answer.
Consider the resource allocation graph shown below. Answer the following three sub- questions. D Write a set of processes. The answer is Write a set of resource types. The answer is Is the system in a deadlock? The answer is (Yes or No).
In the following resource allocation graph, are the processes deadlocked? If “yes” explain why and state which processes are involved in deadlock. If “not" explain why. I believe there is no deadlock but I need help with explanation.
Following is the order in which task requests with a priority of execution are received by a job scheduler. The priority of task execution increases with a greater priority value.Work ID: 464 212 110 840 976 3433 2 3 1 2 2 priorityCreate a treasury for the upcoming tasks. How would the treap appear once the top priority jobs had finished running and left the treap?
Suppose there are three processes, P1, P2, and P3, and three files, FileA, FileB, and FileC. P1 has FileA and wants FileC. P2 has FileB and wants FileA. P3 has FileC and wants FileB. a) Draw a resource allocation graph for this situation. b) Does the graph represent a deadlock? Why or why not? Explain.
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
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 there are four processes and four resource types in a system that avoids deadlockusing Bankers algorithm. The total amount of each resource type is given by the vector[16, 5, 2, 8].the current allocation and claim is given below. process Current Allocation Max Claim A B C D A B C D P1 P2 P3 P4 4 0 0 1 1 2 1 0 1 1 0 2 3 1 1 0 4 6 7 1 4 3 5 1 13 5 2 7 6 1 3 1 a. Illustrate this state is safe?b. Find out 2 possible safe sequences by using Bankers algorithm. ( SUBJECT:operating system)
1. Two processes, A and B, each need three resources, 1, 2, and 3. Suppose 4 requests them in the order 1, 2, 3. If B also requests them in the same order, deadlock is not possible. However, if B requests them in the order 3, 2, 1, then deadlock is possible. With three resources, there are 3! or six possible orders in which B can request them. For each possible order in which B can request these resources, state whether or not a deadlock is possible for that order. (Assume that once a process acquires a resource, it does not release that resource until the end of that process.) a) 1, 2, 3 b) 1,3,2 c) 2, 1, 3 d) 2, 3, 1 e) 3, 1, 2 f) 3, 2, 1
In the following resource allocation graph, are the processes deadlocked? If “yes” explain why and state which processes are involved in deadlock. If “not” explain why.
Assume a binary semaphore variable, S is initialized to 1. The semaphore operations flow which is wait (S) – critical section – signal (S) has been changed. The new flow is signal (S) – critical section – wait (S). What will happened in this situation? Select one: a.a deadlock will occur b.processes will starve to enter critical section c.several processes maybe executing in their critical section
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