1.5. Given the following state of system: the system comprises of four processes and three resources. P1-P4 denotes the set of processes R1-R3 denotes the set of resources Claim Matrix C RI R2 R3 P1 4 5 3 23 P2 P31 2 3 P4 Allocation Matrix A R1R2 R3 2 0 P2 Available Matrix V RI R2 R3 1.5.1 Compute the Resource vector R. 1.5.2 Compute the need Matrix Is the curent allocation state safe? If, give a safe sequence of the process. In addition, show how the Available (working array) changes as each 1.5.3 process temminates

1.5. Given the following state of system: the system comprises of four processes and three resources. P1-P4 denotes the set of processes R1-R3 denotes the set of resources Claim Matrix C RI R2 R3 P1 4 5 3 23 P2 P31 2 3 P4 Allocation Matrix A R1R2 R3 2 0 P2 Available Matrix V RI R2 R3 1.5.1 Compute the Resource vector R. 1.5.2 Compute the need Matrix Is the curent allocation state safe? If, give a safe sequence of the process. In addition, show how the Available (working array) changes as each 1.5.3 process temminates

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

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.
1. In a certain device, the disk rotates at 5000rpm. a) how long does one revolution take? b) what is the average rotational delay of this disk drive 2. Consider a disk dirve with 1000 tracks, numbered 0 to 999. The request queue has the following composition: 300 740 150 940 200 850 145 555 775 695. The current position is 197 and the previous request was served at 100. For each of the following disk scheduling algorithsm, compute the total distance (in tracks) that the disk arm would move. Include the calculation steps in your answers. 2.1 First - In-First-Out (FIFO) 2.2 Shortest - Service-Time - First (SSTF) 2.3 SCAN (no LOOK variation) 2.4 C-SCAN (No C-LOOK variation)
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?
An operating system has 3 user processes running in a set, each requiring 2 units of resource R. The minimum number of units of R such that no deadlocks will ever arise is:
P is a set of processes. R is a set of resources. E is a set of request or assignment edges. The sets P, R, and E are as follows: P = {P1, P2, P3} R = {R1, R2, R3} E = {P1 -> R1, P2 -> R3, P3-> R2, R1 -> P2, R2 -> P2, R2 -> P1, R3 -> P3} R1 has one instance. R2 has two instances. R3 has one instance. a. Explain clearly with the help of a properly labelled diagram what is a resource allocation graph? Draw the resource-allocation graph for the given case also. b. Is there any deadlock in this situation? Explain your answer clearly.
P is a set of processes. R is a set of resources. E is a set of request or assignment edges. The sets P, R,and E are as follows:P = {P1, P2, P3}R = {R1, R2, R3}E = {P1 -> R1, P2 -> R3, P3-> R2, R1 -> P2, R2 -> P2, R2 -> P1, R3 -> P3}R1 has one instance. R2 has two instances. R3 has one instance.a. Explain clearly with the help of a properly labelled diagram what is a resource allocation graph?Draw the resource-allocation graph for the given case also. [2 + 1]b. Is there any deadlock in this situation? Explain your answer clearly.
b.Start from the resource allocation state in Q 13. If a request from a process P3 arrives for (1, 2, 3), can the request be immediately granted ? Why or why not ? c.Start from the resource allocation state in Q 13. Suppose that P4 asks for 2 instances of resource B. Can the system grant this if it wants to avoid deadlock ? Explain.
There are 3 resources R1, R2 and R3 with one instance each and three processes P1, P2 and P3 in an operating system. A snapshot of the system resource allocation graph shows the following: R1 is allocated to P2; R2 is allocated to P1; R3 is allocated to P3; P1 requests R1; P2 requests R3; P3 requests R2. Which of the following is true about this system? answer ) a)Undetermined b)There is deadlock in the system c)Deadlock will never happen d)There is no deadlock in the system
Consider the following resource-allocation policy. Requests for and releases of resources are allowed at any time. If a request for resources cannot be satisfied because the resources are not available, then we check any processes that are blocked waiting for resources. If a blocked process has the desired resources, then these resources are taken away from it and are given to the requesting process. The vector of resources for which the blocked process is waiting is increased to include the resources that were taken away. For example, consider a system with three resource types and the vector Available initialized to (4, 2, 2). If process P0 asks for (2, 2, 1), it gets them. If P1 asks for (1, 0, 1), it gets them. Then, if P0 asks for (0, 0, 1), it is blocked (resource not available). If P2 now asks for (2, 0, 0), it gets the available one (1, 0, 0) and one that was allocated to P0 (since P0 is blocked). P0’s Allocation vector goes down to (1, 2, 1), and its Need vector goes up to (1,…
In your opinion what does the term semaphore mean in terms of managing concurrent processes in operating systems. a) consider the case of a non negative counting semaphore S. During an execution, 18P(S) operations and 13 V (S) operations were carried out in some order. What is the largest initial value of S for which at least two P(S) operations are blocked?
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?
Suppose the head of a moving head disk with 200 tracks numbered 0-199 is currently servinga request at track 143. It has just finished a request at track 125. If the queue of requests iskept in the FIFO order,86,147,85,177,94,150,102,175,130What is the total head movement to satisfy these requests for the following disk schedulingalgorithms? First Come First Served Shortest Seek Time First SCAN