A system has four processes, viz. P1 to P4, and three resource types. The system is in a safe state with [011] Available = [1 1 1], Max = 624 435 [121] granted? (a) Request = [1 0 1] from P3. (b) Request = [1 0 1] from P2. and Allocation = [001] 423 333 Lo 2 13 Which of the following requests should be

A system has four processes, viz. P1 to P4, and three resource types. The system is in a safe state with [011] Available = [1 1 1], Max = 624 435 [121] granted? (a) Request = [1 0 1] from P3. (b) Request = [1 0 1] from P2. and Allocation = [001] 423 333 Lo 2 13 Which of the following requests should be

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section: Chapter Questions

Problem 17RP

See similar textbooks

Similar questions

A system has four processes, viz. P1 to P4, and three resource types. The system is in a safe state with 011] Available [111], Max = 624 435 L121 granted? (a) Request = [1 0 1] from P3. (b) Request [101] from P2. and Allocation = [001] 423 333 10 2 1. Which of the following requests should be
Given that there are FIVE (5) processes (A, B, C, D and E) and FOUR (4) resources (R1, R2,R3 and R4) involved in a project. Assume that all the resources are non-sharable and the number of instances for each resource is 2, 3, 2, 3 respectively. *Process A holds one instance of R1, R2 and R4. It requests one instance of R3.* Process B holds one instance of R1 and R3. It requests one instance of R4.* Process C holds one instance of R2 and R4.* Process D holds one instance of R2 and R4. It requests one instance of R1.* Process E holds one instance of R3. It requests one instance of R2. (i) Draw a directed resources allocation graph for the above scenario and Are these five processes in a deadlock state? Justify your answer.
Consider a computer environment in which there are 4 magnetic drives, 2 printers, 3 scanners, and 1 optical drive. Three processes P1, P2, P3 are using these resources. At any point in time, the allocations and requests for these resources are as follows. Allocations: Magnetic drive Printer Scanner Optical drive P1 1 P2 2 1 P3 1 Requests: Magnetic drive 2 Printer Scanner Optical drive P1 1 P2 1 1 P3 2 1 Is there any way that the processes can complete without deadlock? If yes, explain how. If not, explain why not.
26. A system has four processes and five allocatable resources. The current allocation and maximum needs are as follows: Available 00 x 1 1 Allocated Махітит Process A 10 211 11213 Process B 20110 22210 Process C Process D 11010 21310 1111 0 11221 What is the smallest value of x for which this is a safe state?
Assume that there are the following processes in the deadline scheduler queue: Process Arrival Runtime Period Deadline 1 0 2 12 10 2 2 4 20 16 3 4 3 15 14 Complete the following schedule so each of the processes adheres to the deadline policy by replacing a dot with a process number (as necessary): TIME: 01234567890123456789012345678901234567890123456789 PROCESS: 112222333.......................................
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
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 following table as a snapshot of resources in a system: A (10 instances), B (5 instances), and C (7 instances). a) Write down the calculation steps to find a Safe/Unsafe state: b) Is this system in a safe state? If so, write the safe sequence. Allocation Max Available АВС АВС 332 Po P1 P2 P3 PA 010 753 200 322 302 902 211 222 002 433
A dentist office is currently using paper files to manage all office activities. To make their work easier, the office decided to build a software system to manage those activities instead of using their old paper-way methods. The office patients can take their appointments either by phone or by walking in person to the office lobby. In either way, the receptionist schedules an appointment for the patient with the desired date and time. The system shall not allow scheduling appointments with the same doctor for a duration of less than 30 minutes. Of course, the system shall accept appointments for a specific doctor if the doctor is working on that time. This means that the system shall keep track of each doctor working schedule. The office receptionist enters doctors working schedule in the form of working days for each week. For example, a doctor work schedule can be on Monday, Wednesday, and Thursday from 9:00 am until 4:00 pm for all weeks until June 01, 2021. Now, the office…
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:
10. Consider a file F to be shared by N processes. Each process i has ID i (1 <= i <= N). The file can be accessed concurrently by multiple processes, if the sum of the IDs of these processes is less than or equal to M. a) Write a monitor that will control access to the file. That means the monitor will implement two functions, request() and release(), that will be called by a process that would like to access the file. You also need to define the monitor variables required for the solution. A process will call the request() function before accessing the file and release() function when it has finished accessing the file. b) This time implement the request() and release() functions using mutex and condition variables (like POSIX Pthreads mutex and condition variables). You need to define some global variables as well to implement these functions.
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Ý, and Z to three processes PO, P1, and P2. The table given below presents the current system state. There are 3 instances of type X, 2 instances of type Y and 2 instances of type Z still available. The system is currently in a safe state. Answer the following questions! Allocation Max X Y z X Y PO 0 1 8 4 3 (a) If PO requests 2 instances of Z during the P1 3 2 current state, can it be granted? Explain! (b) If P1 requests 2 instances of X during the P2 2 1 1 3 3 3 current state, can it be granted? Explain! CO