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 с R3

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 с R3

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 database with objects X and Y and assume that there are two transactions T1 and T2. Transaction T1 reads objects X and Y and then writes object X. Transaction T2 reads objects X and Y and then writes objects X and Y. 1. Give an example schedule with actions of transactions T1 and T2 on objects X and Y that results in a write-read conflict. 2. Give an example schedule with actions of transactions T1 and T2 on objects X and Y that results in a read-write conflict. 3. Give an example schedule with actions of transactions T1 and T2 on objects X and Y that results in a write-write conflict.
1. Consider the following task set scheduled according to the rate monotonic assignment and answer the questions accordingly. T1-(1, 0.5), T2= (1.5, 0.4) (a) Is the schedule feasible? (b) Do these tasks fully utilize the processor (based on RM scheduling)? Show your answer. (c) (if the answer to (b) is “no",) Change the run time of the first task so that the resulting set will maximize the utilization of the processor under RM scheduling. (d) What is the maximum achievable utilization if the period for the second task was changed from 1.5 to 2 (and the run times could also be modified to achieve maximum utilization)?
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?
2 Recall the various deadlock detection and prevention algorithms we've discussed in class and consider the following snapshot of a system with five processes (P10, P11, P12, P13, P14) and four resources (R1, R2, R3, R4). R1, R2, R3, and R4 have a total of 11, 13, 7, and 9 resources, respectively. There are no current outstanding queued unsatisfied requests. Table 1: Allocation Table 2: Max R3 R4 PID R.1 R2 R3 R4 PID R1 10 4 11 3 12 1 215 2 1 3 10 13 0 5 0 14 1 3012 4 11 12 012 1 13 1 14 231323 75524 R2 5 5 432300 36373 8 Is the system currently in a safe or unsafe state? If safe, provide the process execution order. If unsafe explain your answer.
Consider the following set of tasks in a real-time system: 10. Consider the following set of tasks in a real-time system: Tasks Release time Execution time Absolute deadline T 1 7 40 T 2 4 9 30 T 3 7 40 T 4 9 10 30 Perform EDF scheduling on this task set.
There are 4 processes – PO, P1,P2,P3 and three resources A,B,C are available. The resource A has 9, B has 4 instances, C has 5 instances. Use Banker's algorithm to find out whether the system is in safe state or not. Max Allocation Need Available A B A A C A B C PO 3 3 2 2 1 1 4 P1 3 1 1 13 1 P2 5 1 2 P3 2 1 2 1 i) Calculate the need matrix ii) Identify the safe sequence U-O o o
If a resource allocation graph notes a cycle is present, this always notes a deadlock. True False
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.
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.
Processes P1, P2, and P2 are queued to run. The arrival time of P1 is t = 0, the arrival time of P2 is t = 1, and the arrival time of P3 is t = 2. According to the first come first serve (FCFS) algorithm, processes are run by the operating system. P1 operates 7 time units, P2 4 time units, P3 operates 1 time unit. So what is the average waiting time (in time units) for this system? 0 5 3 7
Given a system of 4 processes with a set of constraints described by the following precedence relation: › : {(P1, P3), (P1, P4), (P2, P4)} The processes access memory locations according to the table attached. Answer the following questions about the system (you are not required to draw any graphs): 1. Is the system determinate for all interpretations of its processes? Explain why. 2. Is the process pair (P3, P4) mutually non-interfering (MNI)? Explain why. 3. If the process pair (P3, P4) is not MNI, what modifications are necessary to guarantee that the system is determinate for all interpretations?