Consider the following maximum-claim reusable resource system with processes ahd three resource types. The maximum claim matrix is given by [4 1 4 3 1 4 C = 5 6 13 li 1 where Cij denote maximum claim of process I for resource j. The total units of each resource type are given by the vector (5, 8, 15). The current allocation of resources is given by the matrix [0 1 41 2 0 3 A = 1 4 1 li 0 3] where aij denotes the units of resource type j currently allocated to process i. The processes and resources are both indexed from 0. 1. Determine if the current state of the system is safe. 2. Determine if a request by process 2 for 4 units of resource 2 can be safely granted.

Consider the following maximum-claim reusable resource system with processes ahd three resource types. The maximum claim matrix is given by [4 1 4 3 1 4 C = 5 6 13 li 1 where Cij denote maximum claim of process I for resource j. The total units of each resource type are given by the vector (5, 8, 15). The current allocation of resources is given by the matrix [0 1 41 2 0 3 A = 1 4 1 li 0 3] where aij denotes the units of resource type j currently allocated to process i. The processes and resources are both indexed from 0. 1. Determine if the current state of the system is safe. 2. Determine if a request by process 2 for 4 units of resource 2 can be safely granted.

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 maximum-claim reusable resource system with four processes (P0, P1, P2, P3) and three resource types (R0, R1, R2). The maximum claim matrix C is given as: R0 R1 R2 P0 4 1 4 P1 3 1 4 P2 5 6 13 P3 1 1 6 Where Cij denotes the maximum claim of the process i for resource j. The total number of units of each resource type is given by the vector: R0 R1 R2 5 8 15 The current allocation of resources is given by matrix A: R0 R1 R2 P0 0 1 4 P1 2 0 3 P2 1 4 1 P3 1 0 3 Answer the following question about the system: For the system state shown above, determine if a new request by process P2 for 6 units of resource R2 can be safely granted. (Remark: You can assume that the system state above does not yet accommodate this request.). Explain your reasoning. If the request cannot be safely granted, how should the system behave with respect to the request?
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.
Consider the following Scenario the Modeling of which you have completed in Assignment1: The Ministry of XYZ is the government body in the in charge of religious affairs. The application for Hajj is submitted to the hajj directorate, part of XYZ Ministry. Initial documents are submitted to the hajj directorate for registration. Documents are checked and verified by the Assistant Registration Officer. There are two categories of applicants based on their nationality. Specified percentage of seats are fixed for locals and other nationals. A unique registration number is issued to each applicant by the Assistant Registration Officer. After the completion of registration process, each applicant is asked to submit the detailed documentation which includes passport, vaccination certificate, medical certificate, receipts of payments. One Additional document (permission letter from home country) is needed for other national. Payments can be made through cash or card. Assistant Registration…
Read the following scenario and answer the questions given bellow.• A car rental company has its offices in three major cites of the area. Acostumer once registered with the company, can avail its services from anynearby office. Every office keeps record of the vehicles, their drivers andrenting details. Salaries of administrative staff are controlled at a single sitewhile the drivers are paid (according to the services they provide) from their local office. Rates for famous tourism spots are fixed (with a slight difference for different vehicles), while other spots are charged according to the mileage covered. 1. Identify the entities involved in the database designed for thecompany.2. Draw GCS for the system.3. Give details of any of the relations replicated on more than one sites
Table 1. 4 processes arriving shown in Operating System Scheduling PDF for Shortest Job Next, non- preemptive Process Arrival Times Execution Times Service Times sequence Wait Times calculations PO 0 12 P1 21 9 P2 41 6 P3 6 3 Total wait time = ? Here the 4 processes of the PDF are repeated in Table 1, with arrival times changed to 0, 2, 4, and 6 respectively. Also, the execution times are changed to 12, 9, 6, and 3. You will be asked to fill table 1 with the numbers like the service times (when is each process serviced), the sequence of executions of these 4 processes in part (a) and part (b) below. Also, you will compute the total wait time. Note for FCFS, it is 1, 2, 3, 4 for P0, P1, P2, and P3; • for the SJN or Shortest Job Next with non-preemptive, PO is #1, P1 may not be #2; for SRT, or shortest remaining time, the preemptive version of SJN, PO is #1, but after 2 time units when P1 comes, P1 kicks out PO since its execution time is 4 < 9- 2 = 7; and P1 may be preempted by P2 later…
Consider a system with five processes and three resource type. Resource type X has 7 instances, resource type Y has 10 instances and resource type Z has 5 instances. Suppose that at time 0, the following snapshot of the system has been taken. What is the content of the matrix Need?
Consider the following snapshot of a system: Allocation Маx Available Process ABCD АВСD АВСD 2001 4212 332 1 PO P1 3121 5252 P2 2103 2316 P3 1312 1424 P4 1432 3665 Answer the following questions using the banker's algorithm: 1. How many instances of resources are present in the system under each type of a resource? 2. What is the content of the matrix Need? و ترغعب في أن يظهر منا.1 lingعمهاطل تخنسم اشرما مبريافحضلا نمر بياليا انتسي 3. Is the system in a safe state? (explain your answer) 4. If a request from process P1 arrives for (1,1,0,0), can the request be granted immediately? (explain your answer)
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
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)
e. Consider the following UML diagram. Professor rank 1..3 PT-Info rating Instructor name pk office 0..1 { complete, disjoint} PTeach Assistant years Course course# pk dept 0..2 ATeach 3..6 (a) According to the diagram, what are the minimum and maximum total number of instructors for a given course? (b) According to the diagram, what is the minimum and maximum teaching load (number of courses) for professors? For assistants? (c) Translate the UML diagram to a relational schema. There are several possible automatic translations; use the translation for subclassing most appropriate for the specified properties as described in the diagram. (d) Specify a minimal key for each relation in your solution to part (c). (e) Suppose by default attribute values cannot contain null. Does your solution to part (c) require any attributes to permit null values?
Create an ER Diagram for the following scenario. Please state any assumptions you have madein your answer.A university offers a Mathematics program. This program can offer any amount ofcourses in a semester. Each course has a roster limit, location and time slot. A studentcan be registered for any number of courses in a semester but to register for a coursethey must have a valid student ID and address. Each course is assigned a singleprofessor. Only on completion of a course, a student receives a final grade for thatcourse.
Q3|II Produce a use case model for the following scenario: "The hotel housekeeping manager checks the requirement file once weekly to ensure that there are sufficient quantities of soaps, shampoos etc. Where necessary, an order is raised to be sent to the supplier. Copies of the orders are kept and used to check the supplier delivery notes and invoices when they are received. Occasionally the suppliers are unable to send the requested things and suggested alternatives. Once the requirements have been supplied the stock file is updated."