In the resource allocation graph below the letters A, B,..., G represent processes while numbers 1,2,..., 9 represent resources. An arrow going from a resource to a process means that the process holds the resource. 6 Α) 8 3 1 E (G) 4 9 2 F 7 D 5 B (a) Find all processes (in the graph above) which are in a deadlock. (b) What if we kill process D? Which processes are in a deadlock after that action? (c) Assume that there are only three processes labeled A, B, C and three resources labeled 1,2,3. Draw the resource allocation graph for the following sequence of requests: process A requests resource 1; process C requests resource 2; • process B requests resource 1; process A requests resource 2; process B requests resource 3; process C requests resource 3. Which of the above processes are in a deadlock? Justify your answer.

In the resource allocation graph below the letters A, B,..., G represent processes while numbers 1,2,..., 9 represent resources. An arrow going from a resource to a process means that the process holds the resource. 6 Α) 8 3 1 E (G) 4 9 2 F 7 D 5 B (a) Find all processes (in the graph above) which are in a deadlock. (b) What if we kill process D? Which processes are in a deadlock after that action? (c) Assume that there are only three processes labeled A, B, C and three resources labeled 1,2,3. Draw the resource allocation graph for the following sequence of requests: process A requests resource 1; process C requests resource 2; • process B requests resource 1; process A requests resource 2; process B requests resource 3; process C requests resource 3. Which of the above processes are in a deadlock? Justify your 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

Draw “Conflict Serializability” graph for given schedule and tell if schedule is serializable or not.
A dispatcher of RTOS has the following three resources, A, B, and C. A has 7 instances, B has 5 instances, and C has 6 instances. At this time, the allocation, request and available map is shown in table Q1 below. a. Is this system in a safe state? Execute necessary algorithm to show your result. b. Is there a valid sequence that can work for this map? If so show it and state if it is the only one or not. c. Given the allocation table below, if PO requests 1 more resource from A and it is granted, will the system be in a safe state? d. Given the allocation table below, if C has a total of 5 slots that will leave C with only 1 available instance, will the system be in a safe state? If not, suggest a solution to overcome deadlock. Table Ql Allocation Requested Available C PO 1. 2. P1 P2 1. 1. P3 1. 2. 4 A HO 12
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
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.
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.
Eight batch jobs arrive almost at the same time in the following order: I₁, 2, ..., II8. The table below contains their running times and priorities: Job П1 П2 П3 П4 П П П П Running time (in min) 4 5 5 10 8 10 7 Priority 1 7 5 2 8 6 4 3 The highest priority is 1. For each of the following scheduling algorithms, determine the order of execution of processes and the mean process turnaround time: (a) priority scheduling; (b) first-come, first-served; (c) shortest job first. Scheduling is non-preemptive.
M6
Consider the following processes schedule using RR Scheduling algorithm If the CPU scheduling policy is Round Robin with time quantum = 3 unit: Process Arrival time Burst Time P1 P2 P3 P4 P5 5 P6 4 3 1 2 5 6 6 7 9 2 Turn around time 3 Draw the ready queue, Gantt Chart for the schedule and find the TAT, WT, RT for each process then, find the Average waiting time, Response Time and the average turnaround time. Waiting Time Response Time
In the resource allocation graph below the letters A, B,..., I represent processes while numbers 1, 2,..., 9 represent resources. An arrow going from a resource to a process means that the process holds the resource. F 2 3 B 6 9 (E) 7 4 H 8 (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 be killed? (c) Assume that there are four processes labeled A, B, C, D and four resources labeled 1, 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.
When a stalemate occurs, those processes should be terminated, with the following outcomes:
There are 4 processes – PO, P1,P2,P3 and three resources A,B,C are available. The resource A has 9, B has 4 instances, C has 5 instances. Use Banker's algorithm to find out whether the system is in safe state or not. Max Allocation Need Available A B A A C A B C PO 3 3 2 2 1 1 4 P1 3 1 1 13 1 P2 5 1 2 P3 2 1 2 1 i) Calculate the need matrix ii) Identify the safe sequence U-O o o
consider the block problem. please solve it with explanations artificial intelligence