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

Money making supermarket chain problem, Consider the ER schema below for th...

Consider the ER schema below for the MoneyMaking supermarket chain problem. Translate the given ER schema into SQL CREATE TABLE statement.

What is null described testing for null in sql?, What is NULL? Give an exa...

What is NULL? Give an example to described testing for NULL in SQL? The NULL SQL keyword is used to represent either a missing value or a value which is not applicable in a re

Differentiate between static hashing and dynamic hashing, Differentiate bet...

Differentiate between static hashing and dynamic hashing.  Ans: Static Hashing comprises the number of primary pages in the directory fixed. So, while a bucket is full, we requ

Why dml is used for, Why DML is used for? DML is used to Manipulation and...

Why DML is used for? DML is used to Manipulation and processing of database. DML is provided for manipulation & processing of database. (Data stored in the database is processed

State the meaning of self-transition, What is self-transition? ...

What is self-transition? If there is a transition which goes back to same state, it is known as "self- transition." With a trigger action exit action would be executed f

Explain the two types of participation constraint, Explain the two types of...

Explain the two types of participation constraint.  Total: The participation of an entity set E in a relationship set R is said to be total if each entity in E participates i

Relational schema, crete a data base relationship model Entity: ...

crete a data base relationship model Entity: Students; Professors; Dormitories buildings; Attributes of students: Name; Address; Dorm;

Architecture, With the help of a suitable diagram gives module wise explana...

With the help of a suitable diagram gives module wise explanation of system architecture of DBMS.on..

Describe the grant function and explain security, Describe the GRANT functi...

Describe the GRANT function and explain, how it associates to security. What kind of privileges may be granted? How are they revoked? Ans: Since more than one user can aacce

Example of database optimisation, Create 1 experiment to demonstrate an asp...

Create 1 experiment to demonstrate an aspect of query optimisation by using access-path structures (indexes), decomposition, or denormalisation. Once satisfied with your experiment

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