Consider the following system with 4 processes and 2 resources. The allocation and requestmatrices and available vector are given below.Request MatrixProcess A B4 31217Allocation MatrixAvailableBProcess ABP14P1AP213P245P312P3P4P451What will be the available for A and B after the execution of process P1?O a. A = 8, B = 6O b. None of theseO .A = 6, B = 4O d. A = 8, B = 8O e. A = 6, B = 8

Given, Allocation Matrix: A B P1 4 1 P2 1 3 P3 1 2 P4 2 0 Request or Need Matrix:…

Consider the following system with 4 processes and 2 resources. The allocation and request matrices and available vector are given below. Allocation Matrix Request Matrix Process A B 4 3 12 17 5 1 Available B 5 Process A B P1 4 1 P2 P3 1 P4 P1 A P2 4 2 P3 2 P4 What will be the available for A and B after the execution of process P1?

Consider the following system with 4 processes and 2 resources. The allocation and request matrices and available vector are given below. Allocation Matrix Request Matrix Process A B 4 3 12 17 5 1 Available B 5 Process A B P1 4 1 P2 P3 1 P4 P1 A P2 4 2 P3 2 P4 What will be the available for A and B after the execution of process P1?

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 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,…
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.
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
Suppose processes P1-P4 with the given priorities and resource allocations. 1 is the highest priority and 4 is the lowest priority. Let us also assume that the "no preemption" condition is now relaxed by allowing preemption of resources by processes of higher priority. For example, P3 may preempt P2 or P4 if it needs a resource which they are holding. If P3 preempts one of these processes, say P4, then P4 release all the resources it is holding. Show one sequence of events in which resources are allocated to the 4 processes and the resulting preemptions, if any, until all new requests are serviced. Current allocations are shown below. Each resource has 4 instances. Try to minimize the preemptions as they are expensive. Process ID Process Priority Current allocation New request R1 R2 R1 R2 P1 1 2 1 2 1 P2 3 0 1 1 0 P3 2 1 1 0 1 P4 4 1 1 2 1
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.
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?
Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63, moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing these requests is
Suppose there are 8 processes in a system which are waiting to be assigned to the ready queue. The processes have the following properties. Process P1 has burst time 15, priority 6 Process P2 has burst time 12, priority 4 Process P3 has burst time 6, priority 12 Process P4 has burst time 5, priority 11 Process P5 has burst time 8, priority 9 Process P6 has burst time 9, priority 2 Process P7 has burst time 2, priority 20 Process P8 has burst time 17, priority 6 You have to use Multilevel Feedback Queue. It has three queues. The first queue takes processes with priority value from 1 to 5, the second queue takes processes with priority value of 6 to 10 and rest of the processes go to the third queue. First queue follows Round Robin Scheduling with time quantum= 4 Second queue follows Round Robin Scheduling with time quantum = 6 Third queue follows FCFC scheduling. Draw the gantt chart and calculate the average waiting time.
Given that main memory is composed of two page frames for public use and that aseven-page program (with pages A,B, C, D) requests pages in the following order:A, B, A, C, A, B, D, B, A, C, Da. Using the FIFO page removal algorithm, do a page trace analysis indicating pagefaults with asterisks (*). Then compute the failure rate. b. Using the LRU page removal algorithm, do a page trace analysis indicating pagefaults with asterisks (*). Then compute the failure rate.
1.In the Readers-Writers problem, more than one writer can access the buffer at the same time to write True False 2.Given that processes P1 and P2 are using semaphores to lock resources, determine whether or not the following sequence of requests results in a deadlock. Initially, all resources are available. P1: P2: wait(A) wait(C) wait(B) wait(B) ... .... signal(A) signal(B) signal(B) signal(C) Yes No Insufficient information 3.If no process is executing in its critical section and there exist some processes that wish to enter their critical section, then the selection of the processes that will enter the critical section next cannot be postponed indefinitely. Which option describe best Mutual Exclusion Progress Bounded Waiting None of the above 4.In the producer-consumer problem, the "out" will be used to point to the index in the buffer where a producer can produce next. True False 5.Entry section and Exit section in the code together are referred to as a solution for…
Consider a system consisting of m resources of the same type being shared by n processes, n > m. Each process has a maximum need of m/2 resources. Initially, each process has no resource requests. A process can request or release only one resource at a time. With n=3k and m=2k, for some integer k, show that the system is deadlock free.
Consider the following snapshot of a system: Allocation Max Available A B C D A B C D A B C D T0 2 1 0 6 6 3 2 7 2 1 3 1 T1 3 3 1 3 5 4 1 5 T2 2 3 1 2 6 6 1 4 T3 1 2 3 4 4 3 4 5 T4 3 0 3 0 7 2 6 1 What are the total resources for A, B, C and D respectively? Select one: a.11, 10, 8, 16 b. 13, 10, 11, 16 c.11, 9, 8, 15 d.28, 18, 14, 22