Explain banker''s algorithm, Operating System

Assignment Help:

Banker's Algorithm

In this analogy

Customers

processes

Units

resources, say, tape drive

Banker

Operating System

 

Customers

Used

Max

 

A
B
C
D

0
0
0
0

6
5
4
7

Available Units = 10

 

 

 

 

 

 

 

 


We observe four customers each of whom has been granted a number of credit nits. The banker reserved only 10 units somewhat than 22 units to service them. At definite moment the situation becomes

Customers

Used

Max

 

A
B
C
D

1
1
2
4

6
5
4
7

Available Units = 2

 

 

 

 

 

 

 

 

Safe State-    The key to a state being secure is that there is at least one way for all users to finish. In other analogy the state of is safe because with 2 units left, the banker is able to delay any request except C's, therefore letting C finish and release all four resources. With four units in hand the banker is able to let either D or B have the necessary units and so on.

Unsafe State-     Consider what would take place if a request from B for one more unit were granted

We would have following situation

Customers

Used

Max

 

A
B
C
D

1
2
2
4

6
5
4
7

Available Units = 1

 

 

 

 

 

Fig. 3

 

 

This is an unsafe state.

If all the customers namely A, B, C, and D request for their maximum loans, then banker couldn't satisfy any of them and we would have a deadlock.

It is significant to note that an unsafe state does not imply the existence or even the eventual existence a deadlock. What an unsafe state does involve is simply that some unfortunate sequence of events might lead to a deadlock. The Banker's algorithm is therefore to consider each request as it occurs and see if granting it leads to a safe state. If it does, the request is granted or else, it postponed until later.


Related Discussions:- Explain banker''s algorithm

Explain the architecting for threads, Explain the Architecting For Threads ...

Explain the Architecting For Threads When available, threads are an integral part of any multitasking server application program. It is important that the operating system prov

Explain direct communication and indirect communication, Direct communicati...

Direct communication With direct communication each process that requires to communicate must explicitly name the recipient or sender of the communication. The send and receive

Explain the various page replacement strategies, Explain the various page r...

Explain the various page replacement strategies. Page replacement-basic scheme with diagram Optimal page replacement LRU page replacement FIFO page replacement LRU

Define virtual memory, Define Virtual memory Virtual memory is employe...

Define Virtual memory Virtual memory is employed in all major commercial operating systems

search tree generated by hill-climbing search, Show the search tree genera...

Show the search tree generated by Hill-Climbing search (text figure 4.2, page 122; or Local Search lecture, slide 6) for each of the two heuristics (a) and (b) applied to the follo

Define loader that executed when system is first turned on, Define a loader...

Define a loader that is executed when a system is first turned on or restarted? Bootstrap loader is executed when a system is first turned on or restarted

Pages into physical memory, For reading, most operating systems use demand ...

For reading, most operating systems use demand paging. This means that pages are only read from the disk into physical memory when they are needed. In the page table, there is a re

Dual Mode Operation, I am not getting what you have tried to describe here....

I am not getting what you have tried to describe here. Can you elaborate more about this, i will be thankful to you. Vinay

Define lru page replacement algorithm, Define LRU Page Replacement Algorith...

Define LRU Page Replacement Algorithm LRU policy: LRU expands to least currently use. This policy suggests which we re- move a page whose last usage is farthest from current ti

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