In the resource allocation graph below the letters A, B,..., I represent processes whilenumbers 1, 2,..., 9 represent resources. An arrow going from a resource to a processmeans that the process holds the resource.F23B69 (E)74H8(a) Find all processes (in the graph above) which are in a deadlock.(b) We may kill one or more processes to break the deadlock. Which process should bekilled?(c) Assume that there are four processes labeled A, B, C, D and four resources labeled1, 2, 3, 4. Draw the resource allocation graph for the following sequence of requests.(The resource is assigned to the first process that requested it.)process B requests resource 2;process C requests resource 1;process A requests resource 2;process C requests resource 4;⚫process A requests resource 3;⚫process D requests resource 4;⚫process B requests resource 3;process D requests resource 1.Which of the above processes are in a deadlock? Justify your answer.

(c) Process B requests resource 2:B→2Process C requests resource 1:C→1Process A requests resource 2…

Answered: In the resource allocation graph below…

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 there are two Processes B1 and B2. There is one instance of Resource R1 and two instances of R2. • 81 holds Resource R1 and requesting for Resource R2. • B2 holds Resource R2 and requesting for Resource R1. Consider the scenario in terms of Deadlocks. You may consider drawing a Resource Allocation Graph for the above scenario. (No Upload.Only write answers for a) and b) in the box given below) a) What kind of situation does the graph shows (Deadlock or No Deadlock)? b) Justify(reason) your answer to question (a). A- B I
Recreate this diagram please
Deadlock detection and recovery: Select all of the following statements that are true. A wait-for graph can be constructed from a resource allocation graph by eliminating the resources and collapsing the associated edges. A forced termination of one process to recover from a deadlock never has any side effects on other processes running in the system. In order for a process to be able to return to a previous state, at least one checkpoint of a safe process state is needed. Deadlock detection must be carried out after every resource allocation which cannot be immediately granted. At the start of the banker's algorithm, "Work" refers to the actually available system resources. One sign of a deadlock is that many processes are waiting, although the CPU is not busy.
Write a program* that solves the producer - consumer problem. You may use the following pseudo codefor implementation.*program to write: produce -consumer problem to produce and consume the alphabet.//Shared data: semaphore full, empty, mutex;//pool of n buffers, each can hold one item//mutex provides mutual exclusion to the buffer pool//empty and full count the number of empty and full buffers//Initially: full = 0, empty = n, mutex = 1//Producer threaddo {…produce next item…wait(empty);wait(mutex);…add the item to buffer…signal(mutex);signal(full);} while (1);//Consumer threaddo {wait(full)wait(mutex);…remove next item from buffer…signal(mutex);signal(empty);…consume the item…Lab assignment 6 3/3} while (1)
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?
Real-time Scheduling: Choose all true assertions. Rate Monotonic (RM) scheduling divides time into equal parts and requires each process to seek a portion upon starting. RM schedules real-time systems with CPU utilization below 1. When CPU utilization is less than 1, Earliest Deadline First (EDF) may schedule a real-time system. A process is initiated every p time unit. RM scheduling prioritizes shorter processes. EDF scheduling prioritizes processes with the shortest time frame.
5a
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
The following resource-allocation graph illustrates a deadlock. R₁ True False Ţ₁ T3 L Ţ₂ T₁ R₂
2 Recall the various deadlock detection and prevention algorithms we've discussed in class and consider the following snapshot of a system with five processes (P10, P11, P12, P13, P14) and four resources (R1, R2, R3, R4). R1, R2, R3, and R4 have a total of 11, 13, 7, and 9 resources, respectively. There are no current outstanding queued unsatisfied requests. Table 1: Allocation Table 2: Max R3 R4 PID R.1 R2 R3 R4 PID R1 10 4 11 3 12 1 215 2 1 3 10 13 0 5 0 14 1 3012 4 11 12 012 1 13 1 14 231323 75524 R2 5 5 432300 36373 8 Is the system currently in a safe or unsafe state? If safe, provide the process execution order. If unsafe explain your answer.
correct answer is 13. Can you explain by sperately please?

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS