Question # 4 Part a: Consider the following scenario and draw resource-allocation graph and the coresponding wait-for graph. Process waiting An instance of resource R1 is assigned to process Process P1 is waiting for resource R2 Resource assigned P5 Another instance of resource R1 is assigned to Process P2 is waiting for resource R1 process P1 An instance of resource R2 is assigned to process Process P3 is waiting for resource R3 P4 An instance of resource R3 is assigned to process Process P3 is waiting for resource R2 P4 Another instance of resource R3 is assigned to Process P3 is waiting for resource R2 process P2 Process P4 is waiting for resource R1 Part b: (a) Using the concept of Shortest Remaining Time First algorithm, calculate Average tumaround time and Average waiting time. Process CPU Burst Time Arrival time PO 11 P1 4 1 P2 9. 2 P3 12 3 Р4 18 (b) Calculate total logical and physical address space if logical address is 31 bits and physical address is 22 bits.

Question # 4 Part a: Consider the following scenario and draw resource-allocation graph and the coresponding wait-for graph. Process waiting An instance of resource R1 is assigned to process Process P1 is waiting for resource R2 Resource assigned P5 Another instance of resource R1 is assigned to Process P2 is waiting for resource R1 process P1 An instance of resource R2 is assigned to process Process P3 is waiting for resource R3 P4 An instance of resource R3 is assigned to process Process P3 is waiting for resource R2 P4 Another instance of resource R3 is assigned to Process P3 is waiting for resource R2 process P2 Process P4 is waiting for resource R1 Part b: (a) Using the concept of Shortest Remaining Time First algorithm, calculate Average tumaround time and Average waiting time. Process CPU Burst Time Arrival time PO 11 P1 4 1 P2 9. 2 P3 12 3 Р4 18 (b) Calculate total logical and physical address space if logical address is 31 bits and physical address is 22 bits.

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

The four conditions (mutual exclusion, hold and wait, no pre-emption and circular wait) are necessary for a resource deadlock to occur. Give an example to show that these conditions are not sufficient for a resource deadlock to occur. When are these conditions sufficient for a resource deadlock to occur? Use a resource allocation graph to illustrate your answer
(i) Describe Banker’s algorithm for deadlock avoidance with supporting example Consider a computer system with 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 anyway, that is, two in one shot or one by one. The system always satisfies a request a request for a resource if enough resources are available. If the process doesn’t request any other kind of resource, show that the system never deadlock Give a solution for the following synchronization problem using semaphores Producer- Consumer Problem Readers- Writers Problem List out the issues in preprocessor scheduling that causes performance degradation in multiprocessor systems
Draw the wait-for graph for the following resource allocation graph, and find is there a possibility of deadlock or not.
79. One way to ensure that the circular wait condition never holds is to : a. impose a total ordering of all resource types and to determine whether one precedes another in the ordering b. to never let a process acquire resources that are held by other processes c. to let a process wait for only one resource at a time d. all of the mentioned
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?
Referring to the Resource Allocation Graph shown in Figure 2, answer the following questions: Is there any deadlock contained in the above graph? Explain your answer. Assume now that P2 also requests resource R1. Will there be any deadlocks? Explain your answer. Assume the allocation graph at point 2), and, in addition, assume that R2 has now three instances. Will there be any deadlocks? Explain your answer. Back to the original allocation graph as in Figure 2. Add an additional process P4 that demands an instance of R1. Will there be any deadlocks? Explain your answer.
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 the following snapshot of a system in which five resources A, B, C, D and E are available. The system contains a total of 2 instances of A, 1 of resource B, 1 of resource C, 2 resource D and 1 of resource E. Do the following problems:• Convert this matrix representation to a resource allocation graph.• Use the deadlock detection algorithm to determine whether the system contains a deadlock. Which processes are involved in the deadlock?• While you are use the deadlock detection algorithm, add and remove directed edges of the resource allocation graph.
Ch-6 1. The first known correct software solution to the critical-section problem for n processes with a lower bound on waiting of n − 1 turns was presented by Eisenberg and McGuire. The processes share the following variables: enum pstate { idle, want_in, in_cs}; pstate flag[n]; int turn; All the elements of flag are initially idle. The initial value of turn is immaterial (between 0 andn-1).ThestructureofprocessPi isshowninthefollowingFigure.Provethatthe algorithm satisfies all three requirements for the critical-section problem.
3. Knapsack problem (4’)a. (1’) Show the dynamic programming table when applying the bottom-up dynamicprogramming algorithm to the instance of the knapsack problem? (Capacity W=6)b. (1’) Show the dynamic programming table when applying MemoryKnapsack(i, j)dynamic programming algorithm to the instance of the knapsack problem? (CapacityW=6)c. (1’) What is the optimal subset?d. (1’) What is the maximal value of a feasible subset?
Hey, I have already received a good answer to this question but I am looking for greater detail to be provided. There are three processes P1, P2 and P3 are running in a system with 3 instances of a resource R1, 2 instances of a resource R2, and 2 instances of a resource R3. At a given time the allocation matrix is: A = [{1, 1, 1} { 0, 1, 0} { 1, 0, 0 }] Assume that the maximum matrix is M = [ {2,2,1} {1,1,1} {3,1,0}] While in this state, a new process P4 is created which requires at most 2 instances of R1 and one instance of R2. This process initially requests one instance of R1 to be allocated to it. Using the Banker’s algorithm, determine whether this request can be granted or must be refused.
Given a Resource Allocation Graph G with i processes Pi and j Resources Rj; graph G shows a particular situation at any time. Under which condition of G is it clear that a deadlock cannot occur?