This time i'll share a simulation of the Banker algorithm with safe state that i did on my intern program at IPICYT-CNS LAB.
The Banker's 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, and then makes an "s-state" check to test for possible deadlock conditions for all other pending activities, before deciding whether allocation should be allowed to continue.
We will use C++ and Makefile to build files.
Work directory:- banker/
|- lib/
|- - processes.cpp
|- - processes.h
|- src/
|- - banker.cpp
|- Makefile
