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

Describe a technique for direct search, Describe a technique for direct sea...

Describe a technique for direct search? Explain how data is stored within a file so which direct searching can be performed. For a file of unordered fixed length records by u

Explain growing phase of locking, Explain Growing Phase of locking Grow...

Explain Growing Phase of locking Growing Phase: In this phase the transaction can only obtain locks, but cannot release any lock. The transaction enters the growing phase as so

Explain the term - adjustment of inheritance, Explain the term - Adjustment...

Explain the term - Adjustment of inheritance The inheritance can be enlarged as object design progresses by changing class structure. The designer should do: i) Adjust or r

Explain query tree represent relational algebra expression, How does a quer...

How does a query tree represent a relational algebra expression?      Ans: This includes transforming an initial expression (tree) into an equivalent expression (tree) that is

Binary relationships, One-to-one relationship: For every 1:1 relationshi...

One-to-one relationship: For every 1:1 relationship type R in the ER diagram including two entities E1 and E2 we take one of entities (say E1) preferably with total participatio

Fragmentation, let us consider a table having 2200 records and the fixed si...

let us consider a table having 2200 records and the fixed size of the table to be considered as 25.then how many numbers of table is requredto perform horizontal fragmentation

I need label printing program, Project Description: Hi I'm seeking someo...

Project Description: Hi I'm seeking someone to make my dBase application work. I know it's not a 'modern' language but it's what I know. I have written an order program and I ne

Relational schema for person, Example: RELATIONAL SCHEMA for PERSON: ...

Example: RELATIONAL SCHEMA for PERSON: PERSON (PERSON_ID: integer, NAME: string, AGE: integer, ADDRESS: String) RELATION INSTANCE In this instance, m = 3 and n = 4

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