What is bankers algorithm, Database Management System

Assignment Help:

What is banker's algorithm?

 Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple instances of each resource type. The two algorithms used for its execution are:

a. Safety algorithm: The algorithm for finding out whether or not a system is in a safe state. 

b. Resource-request algorithm: If the resulting resource allocation is safe, the transaction is completed and process Pi is allocated its resources. If the new state is unsafe Pi must wait and the old resource-allocation state is restored. 

 

 


Related Discussions:- What is bankers algorithm

What are the two aspect to the implementation of association, What are the ...

What are the two distinct aspects to the implementation of associations? i) It is required to define data declarations which will enable details of actual links to be stored. I

Differentiate between a subquery and a join, Differentiate between a subque...

Differentiate between a subquery and a join If we need to acquire information from one or more tables after that either subquery or join can be used. If the columns which are t

What are the different kinds of database end users, What are the different ...

What are the different kinds of database end users? Discuss the major activities of each? End-Users - End-users are the people whose jobs need access to the database for que

What are the reasons for having variable length records, What are the reaso...

What are the reasons for having variable length records? What are the various ways to store variable length records? Variable-length records arise in a database in various wa

Equijoin, When every condition appears with equality condition (=) only. c)...

When every condition appears with equality condition (=) only. c)   Natural join (denoted by R*S) When two join attributes have the similar name in both relations. (Tha

Define deadlock prevention, Define deadlock prevention. Deadlock preven...

Define deadlock prevention. Deadlock prevention is a set of methods for ensuring that at least one of the four essential conditions like mutual exclusion, hold and wait, no pre

Locks, Locks: Serialisabilty is just a test whether a given interleaved sch...

Locks: Serialisabilty is just a test whether a given interleaved schedule is ok or has a concurrency related trouble. Though, it does not make sure that the interleaved concurrent

Locking, define locking in simple language and decribed it

define locking in simple language and decribed it

What is multiplicity in the associations, What is multiplicity in the assoc...

What is multiplicity in the associations? Give an example to explain multiplicity? Multiplicity in association indicate number of objects participate in any relationship. For

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