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

Operating system abstractions, When we download a movie from the Internet, ...

When we download a movie from the Internet, we don't care about, say, packet sizes. However, even ifwe are not aware of howlow-level details of networks are implemented, our data i

Command line interface, College life is tough.  Eating pizza for every meal...

College life is tough.  Eating pizza for every meal is hitting you hard.  You are looking at working out to stay healthy.  You found a web site that tells you how many calories eac

What are race conditions?, What are race conditions? Race conditions ar...

What are race conditions? Race conditions are problems that take place due to the sharing of the same file by several processes. In such a case none of the processes is able to

Can indefinite blocking take place, Consider the subsequent resource-alloca...

Consider the subsequent resource-allocation policy. Requests as well as releases for resources are allowed at any time. If a request for resources can't be satisfied because the re

Explain two-phase locking protocol, Q. Show that a few schedules are possib...

Q. Show that a few schedules are possible under the two-phase locking protocol however not possible under the timestamp protocol and vice versa. Answer: A schedule that is auth

Process destruction, Most process abstractions support processes being dest...

Most process abstractions support processes being destroyed when the program terminates, or in response to a specific kill directive. There are two common implementations, one a "p

Explain the os/2 operating system, Explain the OS/2 Operating System Li...

Explain the OS/2 Operating System Like NetWare, OS/2 manage resources at three levels, as shown in Figure 4.5 Resources may be maintained at the session, process, and thread le

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