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

Effective branching rate - heuristic searches, Effective Branching Rate: ...

Effective Branching Rate: Assessing heuristic functions is an important part of "AI" research: a particular heuristic function may sound such a good idea, but in practice give

Discuss in brief the history of e-commerce, Discuss in brief the history of...

Discuss in brief the history of E-Commerce. History of E-commerce illustrated below: E-commerce began before personal computers were prevalent and has grown into a multibill

What is internet routing hierarchy, Q. What is Internet Routing Hierarchy? ...

Q. What is Internet Routing Hierarchy? So how do packets find their way across Internet? Does every computer connected to Internet know where other computers are? Do packets ba

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

Average access time experienced by the processor, Give the formula for the ...

Give the formula for the average access time experienced by the processor in a system with 2 levels of caches. Ans: Formula is for the average access time experienced by the pr

Ascii characters, Display how the value ASCII "MIRIAM" is stored in memory ...

Display how the value ASCII "MIRIAM" is stored in memory in Big Endian format starting at location 100 hexadecimal. Suppose that each memory location kept two ASCII characters.

What are the parts of a deployment diagram, ? Nodes: A node shows any hardw...

? Nodes: A node shows any hardware component. The configuration of hardware is shown by attributes of nodes. ? Components: A component shows software. Every component straight

Pulse train, brief explanation on pulse train

brief explanation on pulse train

Break keys, Like a normal read, your input should break on the new line cha...

Like a normal read, your input should break on the new line character "\n"   and also on the up and down arrow keys. You will process the input made by the user when he/she enters

Explain the synchronous-transmission, A control character is sent at the be...

A control character is sent at the beginning as well as at the end of every block in the synchronous-transmission in order to  (A) Synchronize the clock of transmitter and rece

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