operating systems Question 4. Deadlock - Banker's AlgorithmA system that uses the Banker's Algorithm has six processes and four types of reusable resources (R1, R2,R3 and R4). The current allocation, maximum needs (claims) and available resources are as shown below.Allocation Matrix (A)Claim Matrix (C)Available Vector (V)ProcessR1R2R3R4R1R2R3R4R1R2R3R43 5P1146.P28.1.84P31241.P41171.P51141171 0 11 1 1P6Calculate the Needs matrix (Q) and then determine if this is a safe state? If so, give a sequence in whichthe processes can be serviced. If it is not a safe state then list the processes which are deadlocked. Showall your work and the content of available vector in each step clearly!Needs Matrix (Q)R1R2R3R4P1P2P3P4P5P62.

answer to the above question is in step2.

Question 4. Deadlock - Banker's Algorithm A system that uses the Banker's Algorithm has six processes and four types of reusable resources (R1, R2, R3 and R4). The current allocation, maximum needs (claims) and available resources are as shown below. Allocation Matrix (A) Claim Matrix (C) Available Vector (V) Process R1 R2 R3 R4 R1 R2 R3 R4 R1 R2 R3 R4 P1 3 2 4 6. 1 3 3 5 P2 8. 8. 8. P3 1. 4 4 2 1. 4. P4 1 1 7 1. P5 4 1. 1. 7 P6 0 1 1 1 1 Calculate the Needs matrix (Q) and then determine if this is a safe state? If so, give a sequence in which the processes can be serviced. If it is not a safe state then list the processes which are deadlocked. Show all your work and the content of available vector in each step clearly!

Question 4. Deadlock - Banker's Algorithm A system that uses the Banker's Algorithm has six processes and four types of reusable resources (R1, R2, R3 and R4). The current allocation, maximum needs (claims) and available resources are as shown below. Allocation Matrix (A) Claim Matrix (C) Available Vector (V) Process R1 R2 R3 R4 R1 R2 R3 R4 R1 R2 R3 R4 P1 3 2 4 6. 1 3 3 5 P2 8. 8. 8. P3 1. 4 4 2 1. 4. P4 1 1 7 1. P5 4 1. 1. 7 P6 0 1 1 1 1 Calculate the Needs matrix (Q) and then determine if this is a safe state? If so, give a sequence in which the processes can be serviced. If it is not a safe state then list the processes which are deadlocked. Show all your work and the content of available vector in each step clearly!

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

Sur University Registration - System Scenario: Sur university Registration department (SRD) wants to develop Sur University Registration System (SUReg S), in order to automate the registrations processes, The (SUReg_ S) existing system can be described as follows, the systems stores the following data for faculty_Members ( staff_No, staff_name, dep), for students store the following data (stu_ID, Stu_Name, Stu Address), for (SRD)'s employee saving the following data: (emp_No, job). The (SRD) focusing on the following activities, register courses for students, Entering students marks, calculate total marks, process the result. Calculating the student's total marks, requires checking two important issues firstly check that the student has registered in the required semester, as well as student's absent ratio is less than 20% in all courses. Finally (RAD) announced the students result for a semester or two semesters. Answer the following questions: [Based on the above scenario] A- Create…
Given the following state of system: the system comprises of four processes and three resources. P1 – P4 denotes the set of processes R1 – R3 denotes the set of resources Claim Matrix C R1 R2 R3 P1 4 5 3 P2 3 2 3 P3 1 2 3 P4 1 0 2 Allocation Matrix A R1 R2 R3 P1 2 2 0 P2 3 2 0 P3 1 1 3 P4 0 0 2 Available Matrix V R1 R2 R3 0 3 2 Compute the Resource vector R. (08) Compute the need Matrix Is the current allocation state safe? If, give a safe sequence of the process. In addition, show how the Available (working array) changes as each process terminates.
1. Let A, B and C be three different non-preemptible resource types. Assume maximum claims and current resource assignments for four processes P0, P1, P2, and P3, are given in the following table, along with the total number of allocated resources for each process. Маx Allocation Available АВС АВС АВС РО 001 001 P1 175 100 P2 235 135 P3 065 063 Total 299 152 a) How many resources are there of type (AB.C)? b) What is the contents of the Need matrix? c) Is the system in a safe state? Why? d) If a request from process P1 arrives for additional resources of (0,5,2), can the Banker's algorithm grant the request immediately?
An operating system uses the banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0, P1 and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution Allocation Max X Y Z X Y Z P0 0 0 1 8 4 3 P1 3 2 0 6 2 0 P2 2 1 1 3 3 3 There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in safe state. Consider the following independent requests for additional resources in the current state- REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Write a program to check whether: Only REQ1 can be permitted Only REQ2 can be permitted…
An operating system uses the banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0O, P1 and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution Allocation Max Y X Y PO 8 4 3 P1 3 6 P2 2 1 1 3 3 3 There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in safe state. Consider the following independent requests for additional resources in the current state- REQ1: PO requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Write a program to check whether: A. Only REQ1 can be permitted B. Only REQ2 can be permitted C. Both REQ1 and REQ2 can be permitted D. Neither REQ1 nor REQ2…
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 • P3 Request R2 o P2 request R3 Draw the resource allocation graph and find whether deadlock exists? Justify your answer.
Consider the system with 5 processes <P0, P1, P2, P3, P4> and three resources types (4)A=13, B=13 and C=9. The following information has been attached.
Suppose there are four processes and four resource types in a system that avoids deadlock using Bankers algorithm. The total amount of each resource type is given by the vector [16, 5, 2, 8].the current allocation and claim is given below. Processes Current Allocation Max Claim A B C D A B C D P1 4 0 0 1 4 6 7 1 P2 1 2 1 0 4 3 5 1 P3 1 1 0 2 13 5 2 7 P4 3 1 1 0 6 1 3 1 a. Illustrate this state is safe? b. Find out 2 possible safe sequences by using Bankers algorithm. (operating systems concepts)
Operaing system.
Draw an ER diagram for the EMU Slimming Center based on the specification given below. Case Study 01 A wedding hall (Shadi Hall) organizes different types of functions for its customers. Each function is hosted (owned) by exactly one customer. A customer may host many functions. There are many employees working at the company. Before each function date, the administrations of the wedding hall calls a meeting of relevant employees to finalize the arrangements of the function. Each meeting belongs to exactly one function. Comments/suggestions of each employee in the meetings and the decisions of the meetings are also recorded. Instructions: • Identify the relationship between Entities (clearly showing the cardinality and participation)
The four conditions (mutual exclusion, hold and wait, no pre-emption and circular wait) are necessary for a resource deadlock to occur. Give an example to show that these conditions are not sufficient for a resource deadlock to occur. When are these conditions sufficient for a resource deadlock to occur? Use a resource allocation graph to illustrate your answer
A multi-user database system is used to support the customer payment operations of a XYZ store. Unfortunately, the system currently does not enforce concurrent control on transactions accessing and updating the data. A particular customer had a balance due of HK$ 300 when the following three transactions related to the customer were processed at the same time: (i) Payment of HK$ 300; (ii) Purchase on credit of HK$ 150; and (iii) Merchandise return (credit) of HK$ 100. Each of the three transactions read the customer record when the balance was HK$ 300. That is, all transactions have read the record before any of them was completed. The updated customer record was returned from the transactions to the database in the order of first (i), then (ii) and finally (iii). (a) After the last transaction was completed, what balance will be recorded for the customer? (b) What balance should be actually recorded for the customer after the three transactions have been processed?