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

Octave project, i need help with an octave program

i need help with an octave program

Two properties of recursion, Two properties of recursion are:- 1. A sm...

Two properties of recursion are:- 1. A smallest, base case that is processed without recursion and acts as decision criterion for stopping the method of computation and 2.

Convergence mean with respect to e-commerce, What does the term convergence...

What does the term convergence mean with respect to E-commerce? Convergence with respect to e-commerce   The ability to leverage and integrate the several data sources and

Code density and smaller faster programs, Q. Code Density and Smaller Faste...

Q. Code Density and Smaller Faster Programs? Memory was very expensive in older computer. So there was a need of less memory utilization, which is it was cost effective to have

C programming, At a shop of marbles, packs of marbles are prepared. Packets...

At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with thes

State in brief about the proxy server, State in brief about the proxy serve...

State in brief about the proxy server A proxy server also helps a lot since it hides the real IP addresses of users requesting resources outside the firewall. Finally, the

Define memory cycle time, Define memory cycle time? It is the time dela...

Define memory cycle time? It is the time delay needed between the initiations of two successive memory operations. Eg. The time among two successive read operations.

Database system, What are the three data anomalise that are likely to occur...

What are the three data anomalise that are likely to occur as a result of data redundancy?

Skip to line line number, The "SKIP TO LINE line number" is dependent on wh...

The "SKIP TO LINE line number" is dependent on which statement included in the report statement of the program. The "SKIP TO LINE line number" is dependent on "LINE-COUNT" stat

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