GitHub - sharmashantanu/BankerProblem: The Banker algorithm, sometimes referred to as the detection algorithm, is a resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of predetermined maximum possible amounts of all resources

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
bin/Debug		bin/Debug
obj/Debug		obj/Debug
.gitattributes		.gitattributes
BankerProblem.cbp		BankerProblem.cbp
BankerProblem.depend		BankerProblem.depend
BankerProblem.layout		BankerProblem.layout
Readme		Readme
main.cpp		main.cpp

Repository files navigation

BANKER'S PROBLEM

The banker's algorithm is a resource allocation and deadlock avoidance algorithm that tests for safety by simulating the allocation for predetermined maximum possible amounts of all resources.

This algorithm is being shown using the C++ code.

About

The Banker algorithm, sometimes referred to as the detection algorithm, is a resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of predetermined maximum possible amounts of all resources

deadlock-avoidance bankers-algorithm

Readme