QUESTION 2 Assume that there are : • 3 processes P1, P2, & P3 o 3 Resources R1( two instances), R2 (one instance), & R3 (two instances) And the processes make the requests for resources in the following order: o Pl requests R1 o P2 requests R2 o Pl requests R2 o P3 request R3 o P3 Request R2 o P2 request R3 Draw the resource allocation graph and find wybether deadlock evists? Justify vour answer

QUESTION 2 Assume that there are : • 3 processes P1, P2, & P3 o 3 Resources R1( two instances), R2 (one instance), & R3 (two instances) And the processes make the requests for resources in the following order: o Pl requests R1 o P2 requests R2 o Pl requests R2 o P3 request R3 o P3 Request R2 o P2 request R3 Draw the resource allocation graph and find wybether deadlock evists? Justify vour answer

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

Suppose that an operating system supports two kinds of sequential processes: high-priority interactive processes, and low-priority non-interactive processes. The behavior of the high-priority processes is to alternate between periods of computation of duration Tc and periods of blocking (waiting for input) of duration Tb. The behavior of the low-priority processes is to compute constantly, with no blocking. The operating system’s scheduling policy is round-robin with a quantum q, where Tc < q. Scheduling decisions are made only when a quantum expires, or when the running process blocks. The scheduler selects a low-priority process to run only if no high-priority processes are ready. Suppose there is one high-priority process and one low-priority process in the system, and that both processes will run for a long time. For what fraction of the time does the low-priority process run?
Draw resource allocation graph and explain if the system is in a deadlock or not? • Given 3 processes P1, P2, P3 and 3 resources RI, R2and R3 with I instance each. • Process P1 Holding a resource R1 and requesting for Resource R2. • Process P2 holding resource R2. Process P3 holding resource R3 and requesting for R2.
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.
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.
Using Worst Fit as our dynamic memory allocation strategy, which available block of memory would we allocate an object request that requires 32 bytes Occupied Free-50 Occupied Free-40 Occupied Free-32 Occupied Free-1,000 Free-50 Free-40 Free-32 Free-1,000 Not enough memory
3- Determine whether the following resource-allocation graph has a deadlock? (Assumption: every resource has only one instance). Show all of your work RS PL RIS RII RI R2 R7 P2 R20 RI2 RIO P14 RA Urgent please
q18
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.
What are the basic facts about deadlock situation in resources-allocation-graph?
Concurrent Processes / Monitors select which is true options: a CV (condition variable) queues in a monitor store suspended processes waiting on the corresponding condition. b The "Signal and Wait" approach (Hoare semantics) leads to more efficient implementation and reduces the number of context switches. c Two or more processes can be active in the same monitor simultaneously. d When the "Signal and Continue"-approach (Mesa semantics) is applied, the signaling process P continues executing. e The monitor-based solution to the Dining-Philosophers problem discussed in class is restricted to 5 philosophers.