2- Consider a system with 5 process PO to P4, and three resource type, A has 10 instances , B has 5 instances , C has 7 instances. Spouse at time to following snapshot of the system has been taken: Process Allocation Маx Available A в с A В C A C 0 1 0 7 PO 3 3 0 0 3 2 P1 2 P2 3 0 2 9 P3 2 1 1 2 2 0 0 2 4 P4 2. 2.

2- Consider a system with 5 process PO to P4, and three resource type, A has 10 instances , B has 5 instances , C has 7 instances. Spouse at time to following snapshot of the system has been taken: Process Allocation Маx Available A в с A В C A C 0 1 0 7 PO 3 3 0 0 3 2 P1 2 P2 3 0 2 9 P3 2 1 1 2 2 0 0 2 4 P4 2. 2.

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

A car manufacturing company manufactures 10 cars. The process that goes into manufacturing a car involves various stages. Let's assume the car number C31, starts its assembling process for each of its parts. There is proper system counter maintained for each car that basically represents the five phases During each phase, the counter points to the next level of the assembling process and currently the counter is pointing to Phase 4. The company is maintaining a policy of Priority Scheduling to complete the task. Considering the car number as the process id and the phases as the instruction numbers, design the process control block for the car.
Operating System
Given 4 processes PO 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 Мах Available ABC ABC ABC Po 200 4 1 2 111 P1 10 1 1 1 2 P2 3 1 1 4 3 1 P3 0 1 2 3 2 4 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 P2 be granted? why?
b) Consider 4 processes P0, P1, P2 and P3 that need to share 3 resource types A (10 instances), B (6 instances) and C (7 instances). The allocation of resources and the maximum need for 4 processes as mentioned in the table. Process Allocation Max АВС А ВС Po P1 P2 P3 010 753 200 322 302 902 211 222 Does the sequence of processes satisfy the safety criteria? Note: Provide the working for each step.
Do
Given specifications of a system below. Find a Safe Sequence(s) if it contains using Banker’s and Safety Algorithm. Total Resources: R1: 15, R2:10, R3: 8, R4: 13 Need Max Processes R1 R2 R3 R4 R1 R2 R3 R4 P0 1 1 4 1 3 3 6 3 P1 0 2 5 3 6 3 5 4 P2 1 3 1 2 2 5 1 4 P3 1 1 0 5 5 2 2 8 P4 2 1 1 1 3 2 3 2
All sub parts please
QUESTION 3 Suppose the system has 4 processes and 3 resources At time T15 the snapsbot of the system is taken and given below which of the following options is a safe sequence? Total number of resources-12, 8, 6 Available number of resources-0, 3, 1 Allocation matrie P1 P1 2. P2 1. P2 2. P4 2 P4 O P1. P2. P3, P4 O P4, P1, P3. P2 P1, P3, P2, P4 No safe sequence Saut Arpe Cese Click Save and Submit to save and submit. Click Save All Ansuvers to save all aners, OAC
Based on the below system state, how many number of resource instances of type A, B, C, and D are there? (suppose there is no errors in table) Process Max Allocation Available ... A, B, C, D A, B, C, D A, B, C, D PO 6 0 1 2 40 0 1 3 2 1 1 P1 2750 1 10 0 P2 2356 1 2 5 4 P3 16 5 3 0633 P4 16 5 6 0 2 1 2
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.
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?
Three processes that share five resources of the same kind make constitute a system. For each process, a maximum of two resources are needed. Establish that the system is free of deadlocks.