Consider a system with a total of 150 units of memory, allocated to three processes as shown: Process 1 2 3 Max 70 60 60 Hold 45 40 15 O Apply the banker's algorithm to determine whether it would be safe to grant each of the following requests. If yes, indicate a sequence of terminations that could be guaranteed possible. If no, show the reduction of the resulting allocation table. 1. A fourth process arrives, with a maximum memory need of 60 and an initial need of 25 units. 2. A fourth process arrives, with a maximum memory need of 60 and an initial need of 35 units.

Consider a system with a total of 150 units of memory, allocated to three processes as shown: Process 1 2 3 Max 70 60 60 Hold 45 40 15 O Apply the banker's algorithm to determine whether it would be safe to grant each of the following requests. If yes, indicate a sequence of terminations that could be guaranteed possible. If no, show the reduction of the resulting allocation table. 1. A fourth process arrives, with a maximum memory need of 60 and an initial need of 25 units. 2. A fourth process arrives, with a maximum memory need of 60 and an initial need of 35 units.

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. Three processes share four resource units that can be reserved and released only one at a time. Each process needs a maximum of two units. Show that a deadlock cannot occur. b. N processes share M resource units that can be reserved and released only one at a time. The maximum need of each process does not exceed M, and the sum of all maximum needs is less than M + N. Show that a deadlock cannot occur.
Course:Operating System Solution 4(d) needed
For the employee file discussed in illustrative problem 18.1, making use ofTable P18.1, answer the questions given below:Records from the employee file are to be read and, by making use of the basicpay, allowances and deductions, the total salary is to be computed for eachemployee. Assume that it takes 200 µs of CPU time to perform the computation fora single record. The updated records are to be written onto the disk.a) What is the time taken to process a sector of records?b) Having processed a sector of records, what is the time taken to process allrecords in the very next sector?c) What is the time taken to process the records, in all sectors of a track,assuming that the sectors are continuously read?d) What is the time taken to process all records in a cylinder?
4. The following is the memory configuration at a given point in time where dynamic partitioning scheme is used. The shaded areas indicate memory spaces already allocated to other processes, while the white spaces are holes (free memory spaces). The next FOUR (4) memory requests are 30M, followed by 50M, 20M and 40M (in order). Shade and indicate clearly which memory block will be allocated to each request using the first- fit and next-fit placement algorithms. (First-fit) 20M (Best-fit) 20M (Next-fit) 20M 1 80M 2 3 4 80M b. Given a process segment table as follows: Segment 0 80M (X is the lastest allocated block) 20M Base 496 1202 232 2359 1877 20M 20M Length 691 85 198 109 258 50M 50M 50M 10M 10M 10M X 30M 30M 30M Explain the basic use of segment table in process segmentation and its difference with paging. Give one example on how the information in the given process segment table is used.
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process P1 P2 P3 P4 P5 Burst Time 5 3 1 7 4 Priority 4 1 2 2 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. b) What is the turnaround time of each process for each of the scheduling algorithms in part a? c) What is the waiting time of each process for each of these scheduling algorithms?
Suppose we have three processes P0, P1, and P2. Process P0 executes statement S0 and process P1 executes statement S1 and process P2 executes statement S2. Use wait and signal to ensure the following: S2 is always executed before S1 and S1 is always executed before S0S0.
A system has four processes, viz. P1 to P4, and three resource types. The system is in a safe state with 011] Available [111], Max = 624 435 L121 granted? (a) Request = [1 0 1] from P3. (b) Request [101] from P2. and Allocation = [001] 423 333 10 2 1. Which of the following requests should be
a. Three processes share four resource units that can be reserved and released only one at a time. Each process needs a maximum of two units. Show that a deadlock cannot occur. b. N processes share M resource units that can be reserved and released only one at a time. The maximum need of each process does not exceed M, and the sum of all maximum needs is less than M + N. Show that a deadlock cannot occur.