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

What is busy waiting, What is busy waiting? The repeated implementation...

What is busy waiting? The repeated implementation of a loop of code while waiting for an event to happen is known as busy-waiting. The CPU is not engaged in any actual producti

Define ufd and mfd, Define UFD and MFD. In the two-level directory stru...

Define UFD and MFD. In the two-level directory structure, every user has her own user file directory (UFD). Every UFD has a similar structure, but lists only the files of a one

Define fifo page replacement algorithm, Define FIFO Page Replacement Algori...

Define FIFO Page Replacement Algorithm This policy simply eliminates pages in the order they arrived in the main memory. By using this policy we simply remove a page based upo

Deadlock detection, Deadlocks can be detected while the program is running,...

Deadlocks can be detected while the program is running, by running cycle detection algorithms on the graph that de?nes the current use of resources. De?ne this graph as follows:

Constructional techniques - copper clad circuit board, For the first assign...

For the first assignment you are required to construct a logic circuit onto a copper clad circuit board (vero board). This construction will require the use of planning the positio

FUNDAMENTAL OF OS, WHAT IS OPERATING SYSTEM ?ENLIST AND EXPLAIN BASIC SERVI...

WHAT IS OPERATING SYSTEM ?ENLIST AND EXPLAIN BASIC SERVICES PROVIDE BY OS

Computer number systems, Binary number based systems   Binary is a  ' base...

Binary number based systems   Binary is a  ' base 2' number system, only two numbers exist namely '0' and '1'. Conversion from binary to base 10 is easy if the number column techn

Os structures, #question.explain varios types of system calls..

#question.explain varios types of system calls..

Explain lru approximation page replacement in detail, LRU approximation pag...

LRU approximation page replacement In this we utilize the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for the imp

Define the global vs. local variables, Define the Global vs. local variable...

Define the Global vs. local variables It is also important to discuss the scope of resources being granted to the application program.  Variable scoping is defined as the acces

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