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

What is a single stage network, In a single stage network: (A) ...

In a single stage network: (A)  There is no redundancy (B)  There is redundancy (C)  Alternative cross points are available (D)  Alt

Explain the structure of a c program, Explain the Structure of a C Program?...

Explain the Structure of a C Program? Each C program consists of one or more functions one of the which must be main(). A function name is forever followed by a pair of parenth

Data communication, how CSMA protocol is improved through persistence metho...

how CSMA protocol is improved through persistence methods & collition detection

Explain passing parameters using pointers, Q. Explain Passing Parameters Us...

Q. Explain Passing Parameters Using Pointers ? This method overcomes the drawback of using variable names directly in procedure. It uses registers to pass procedure pointers to

Determine the example of timescale, Determine the Example of timescale ...

Determine the Example of timescale 'timescale 10ns / 1ps Indicates delays are in 10 nanosecond units with 3 decimal points of precision (1 ps is 1/1000ns which is .001 ns).

What are the five popular hashing functions, Five popular hashing functions...

Five popular hashing functions are as follows:- Division Method Midsquare Method Folding Method Multiplicative method Digit Analysis

What is traffic engineering, What is Traffic Engineering? Traffic engi...

What is Traffic Engineering? Traffic engineering gives the basis for analysis and design of telecommunication network to carry a specified traffic at an exact loss probability

Explain working of supercomputer, Q. Explain working of Supercomputer? ...

Q. Explain working of Supercomputer? Supercomputers, capable of executing in excess of one billion floating-point operations per second (FLOPS), are very powerful, extremely hi

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