Define projected allocation state is safe - banker algorithm, Operating System

Assignment Help:

A system consists of 10 units of resource class Ru. The resource needs of three user processes P1, P2 and P3 are like this                   

340_projected allocation state is safe.png

 Using Banker's algorithm, define if the projected allocation state is safe and if the request of P1 will be granted or not.             

 Ans: From the given data:

  Total_alloc=[7]

 Total_exist=[10]

The projected allocation state is feasible because the total allocation in it does not exceed the number of resource units of Ru. As P3 is two units short of its maximum needs and two unallocated units exits in the system, therefore P3 can complete. This will release the resources allocated to it, that is, 5 resources. Here now P1 can complete since the number of unallocated units of Ru exceeds the units required to satisfy its maximum need then P2 can be completed. So the processes can finish in the sequence P3, P1, and P2. Therefore projected allocation state is safe so algorithm will grant the request that is made by P1.


Related Discussions:- Define projected allocation state is safe - banker algorithm

Banker''s algorithm, Consider the following snapshot of a system, answer th...

Consider the following snapshot of a system, answer the following questions using the banker's algorithm: 1. What is the content of the matrix Need? Is the system in a safe stat

Parent and child process communicate in unix, Parent and Child process comm...

Parent and Child process communicate in unix A child and parent can interact through any of the normal  inter-process communication schemes (pipes, message queues, sockets, s

Define state that process must obtain all resources it needs, Before procee...

Before proceeding with its execution, every process must obtain all the resources it needs is called Hold and wait

What do you mean by reference counts, Q. If each the access rights to an o...

Q. If each the access rights to an object are deleted the object can no longer be accessed. At this stage the object should also be deleted and the space it occupies should be ret

Define program preemption, Define Program preemption The Forced de-allo...

Define Program preemption The Forced de-allocation of the CPU from a program which is executing on the CPU is known as Program preemption

Describe what is meant by client-server computing, Question 1: (a) Desc...

Question 1: (a) Describe what is meant by Client-server Computing? (b) Distinguish between a server process and a client process. (c) What are the basic characteristics o

Least-recently used, LRU evicts the page which was last accessed the farthe...

LRU evicts the page which was last accessed the farthest into the past of any page resident in physical memory, i.e. the least-recently used page. LRU approximates OPT when the rec

Homework, Write an application that does the following:(1) fill an array wi...

Write an application that does the following:(1) fill an array with 50 random integers; (2) loop through the array, displaying each value, and count the number of negative values;

Explai basic concepts of demand paging, Basic concepts When a process i...

Basic concepts When a process is to be changed in, the pager guesses which pages will be used before the process is changed out again. Instead of swapping in a entire process,

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd