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

Explain complete binary tree, Complete Binary tree A complete binary tr...

Complete Binary tree A complete binary tree can be described as a binary tree whose non leaf nodes have nonempty left and right sub tree and all leaves are at the similar level

Why we need to construct state transition diagram, Why we need to construct...

Why we need to construct state transition diagram Basically you need to construct a state transition diagram for each object with important behaviour. You need not construct on

What are prefetch instructions, What are prefetch instructions? Prefetc...

What are prefetch instructions? Prefetch instructions are those instructions which can be inserted into a program either by the programmer or by the compiler.

How many methods used to control traffic flowing in-out, How many methods u...

How many methods used to control traffic flowing into and out of the network by firewall? Firewalls utilize one or more of three ways to control traffic flowing into and out of

Explian two limitations of dead-box analysis, (a) Explian two limitations o...

(a) Explian two limitations of dead-box analysis. (b) Describe why memory analysis is difficult. (c) With reference to the "Shadow Walker" rootkit, explain what is meant by

What is a kernel shell, A shell is a program that presents an interface to ...

A shell is a program that presents an interface to several operating system functions and services. The shell is so called because it is an outer layer of interface among the user

Discrete mathmetics and structures, how to prove the partial order R is a t...

how to prove the partial order R is a total order in discrete mathmetics and structures by topological sorting method in c programming

Two layer artificial neural networks, Two Layer Artificial Neural Networks:...

Two Layer Artificial Neural Networks: However decision trees are whenever powerful they are as a simple representation scheme. Whereas graphical on the surface that they can b

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