Given 4 processes PO0 to P3, and 3 resource types: A (7 instances), B (3 instances), and C 5 instances). Suppose a snapshot taken for the system at time To as follows: Allocation Маx Available ABC ABC ABC Po 200 412 111 P1 101 112 P2 3 11 4 3 1 P3 0 12 324 A- Apply Banker's algorithm to determine if the system is in a SAFE or UNSAFE state? Note: show all the changes made to the available resources (work). B- If the system is safe, what is the execution sequence of processes that avoids deadlock? [if unsafe, just write NONE] C- To avoid deadlock, can a request for resources (1,2,0) by P2z be granted? why?

Given 4 processes PO0 to P3, and 3 resource types: A (7 instances), B (3 instances), and C 5 instances). Suppose a snapshot taken for the system at time To as follows: Allocation Маx Available ABC ABC ABC Po 200 412 111 P1 101 112 P2 3 11 4 3 1 P3 0 12 324 A- Apply Banker's algorithm to determine if the system is in a SAFE or UNSAFE state? Note: show all the changes made to the available resources (work). B- If the system is safe, what is the execution sequence of processes that avoids deadlock? [if unsafe, just write NONE] C- To avoid deadlock, can a request for resources (1,2,0) by P2z be granted? why?

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 snapshot of a system: Allocation Маx Available ABCD ABCD ABCD PO 2001 4212 3321 P1 3121 5252 P2 2103 2316 P3 1312 1424 P4 1432 3665 Answer the following questions using the banker's algorithm: a. llustrate that the system is in a safe state by demonstrating an order in which the processes may complete. b. If a request from process P1 arrives for (1, 1, 0, 0), can the request be granted immediately? c.Ifa request from process P4 arrives for (0, 0, 2, 0), can the request be granted immediately? Show transcribed image text
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
Consider the following snapshot of a system: Allocation Мах АВСD АВСD Ро 3014 5117 P1 P2 P3 2210 3211 3121 3321 0510 4612 P4 4212 6325 Using the banker's algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the processes may complete. Otherwise, illustrate why the state is unsafe. a. Available = (0, 3, 0, 1) b. Available = (1,0, 0, 2) %3D
Consider a system with five processes, PO →P4, three resource types, A, B, C. Type A has 9 instances, B has 6 instances, C has 6 instances. At time To the following snapshot of the system is taken. Max Need Available Allocated |A В С A В С А В с 1 1 3 2 2 PO P1 2 7 2 4 1 P2 P3 P4 0 2 4 3 O 2 O 2 1. 20 5 3 3 3 2 0 (You may write down the steps and all answers in a paper and upload) a) Is the system in a safe state? b)Write the Sequence c)Calculate Need matrix d)Write the steps, that leads to your conclusion.
Consider the following snapshot of a system: Allocation Мах АВCD АВCD Po P1 P2 P3 P4 3014 5117 2210 3211 3121 3321 0510 4612 4212 6325 Using the banker's algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the processes may complete. Otherwise, illustrate why the state is unsafe. а. Available 3D (0, 3, 0, 1) b. Available = (1, 0, 0, 2) If a request from process P3 arrives for (3, 0, 2, 0), can the request be granted immediately?
Consider a computer system with the following allocation status for four non-sharable resources, A, B, C, D at a certain time: Allocation Max Available АВCD АВCD АВCD PO 0101 8532 2301 3020 P2 3021 P1 3220 6022 At this instant, P0 requests (0, 2, 0, 1). The Operating System applies Banker's Algorithm to decide whether or not to grant this request. Mark all the correct statements below based on this scenario: O Need (2) = 3001 The system is currently deadlocked. Granting this request brings the system to a safe state. First row of Allocation matrix becomes 0302. O Need (0) = 8230 Available vector becomes 2100. O Need (1) = 0200 %3D
QUESTION TWO A. (i) Describe Banker’s algorithm for deadlock avoidance with supporting example (ii)Consider a computer system with 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 anyway, that is, two in one shot or one by one. The system always satisfies a request a request for a resource if enough resources are available. If the process doesn’t request any other kind of resource, show that the system never deadlock B. Give a solution for the following synchronization problem using semaphores (i)Producer- Consumer Problem (ii)Readers- Writers Problem C. List out the issues in preprocessor scheduling that causes performance degradation in multiprocessor systems
(i) Describe Banker’s algorithm for deadlock avoidance with supporting example Consider a computer system with 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 anyway, that is, two in one shot or one by one. The system always satisfies a request a request for a resource if enough resources are available. If the process doesn’t request any other kind of resource, show that the system never deadlock Give a solution for the following synchronization problem using semaphores Producer- Consumer Problem Readers- Writers Problem List out the issues in preprocessor scheduling that causes performance degradation in multiprocessor systems
Suppose there are N worker processes defined as follows. Develop a monitor BarrierSyn with a procedure passBarrier() for barrier synchronization. Use the Signal and Continue discipline. Hint: In the monitor BarrierSyn, you may define a condition variable oktopass and use signal_all(oktopass) primitive to wait up all delayed processes on the condition variable. process Worker[i = 1 to N] { while (true) { code to implement task i; BarrierSyn.passBarrier(); } }
A set {Po,Pi,.Pn} of waiting processes must exist such that Po is waiting for a resource held by Pi,Pi is waiting for a resource for a resource held by P2., Pn-1 is waiting for a resource held by Pn, and Pn is waiting for a resource held by PO.This condition for deadlock is referred to as a. No Preemption O b. Circular Wait Oc. Mutual Exclusion O d. Hold and Wait
Multiple question A set { P0, P1, Pn} of waiting processes must exist such that P0 is waiting for a resource held by P1, P1 is waiting for a resource held by P2, …, Pn-1 is waiting for a resource held by Pn, and Pn is waiting for a resource held by P0. This condition for deadlock is referred to as a. Hold and Wait b. Circular Wait c. Mutual Exclusion d. No Preemption
Consider the following snapshot of a system: Process Allocation A B C D Max A B C D Available A B C D P0 2 0 0 1 4 2 1 2 3 3 2 1 P1 3 1 2 1 5 2 5 2 P2 2 1 0 3 2 3 1 6 P3 1 3 1 2 1 4 2 4 P4 1 4 3 2 3 6 6 5 Answer the following questions using the banker’s algorithm: How many instances of resources are present in the system under each type of a resource? What is the content of the matrix Need?