Problem based on banker''s algorithm, Computer Engineering

Assignment Help:

A system contains 10 units of resource class Ru. The resource requirements of three user processes P1, P2 and P3 are as follows

                                                P1                  P2                P3

Maximum requirements          8                     7                   5

Current allocation                   3                     1                   3

Balance requirements            5                     6                   2

New request made                 1                     0                   0

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

From the specified data: Total_alloc=[7] Total_exist=[10]

The projected allocation state is feasible as the total allocation into this does not exceed the number of resource units of Ru. Because P3 is two units short of its maximum requirement and two unallocated unit exits into the system, therefore P3 can complete. It will release the resources allocated to this, i.e., 5 resources. Here P1 can complete as the number of unallocated units of Ru exceeds the units required to satisfy its maximum requirement then P2 can be finished.

Therefore the processes can complete in the sequence P3, P1, and P2. Therefore projected allocation state is safe thus algorithm will grant the request made through P1.


Related Discussions:- Problem based on banker''s algorithm

Characteristics of D/A converter, What are the specifications/characteristi...

What are the specifications/characteristics used by the manufacturers to describe a digital to analog converter? Explain each one briefly. Ans: D/A converter characteristics

Explain program source code, Q. Explain Program Source Code? Program S...

Q. Explain Program Source Code? Program Source Code  Every assembly language statement appears as: {identifier}  Keyword {{parameter},}  {;comment}.   Element of a

To show - hide the ssi document in the page, Step 1: Click on Edit Step ...

Step 1: Click on Edit Step 2: Select reference Step 3: Select Translation Step 4: Click on SSI Step 5: For showing the SSI file; choose one of the following options:

Define variants of turing machine, Define variants of Turing Machine?  ...

Define variants of Turing Machine?  Variants are  Non deterministic turing machine.  Mutlitape turing  machine.  Enumerators

Recent parallel programming models, A model for parallel programming is an ...

A model for parallel programming is an abstraction in addition its machine architecture is independent. A model is able to be implemented on different hardware and memory architect

How a file can be shared among different users, Discuss the different techn...

Discuss the different techniques with which a file can be shared among different users. Several popular techniques with that a file can be shared among various users are: 1

Define parity bit and list its types, Define parity bit and List its types....

Define parity bit and List its types. The most common error detection code used is the parity bit. Parity bit is a extra bit contained with a binary message to make the total n

Cloud computing, what is the scope of doing a final year project on cloud c...

what is the scope of doing a final year project on cloud computing?

Implementing recursive function the data structure, For executing recursive...

For executing recursive function the data structure used is: For executing recursive function, stack is used as a data structure.

Super ascii string cost, ascii code add=2unit,replace=1unit,delete=3unit.co...

ascii code add=2unit,replace=1unit,delete=3unit.convert ascii code in minimum cost

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