GitHub - Davidmenamm/Operating_Systems_Bankers_Algorithm: Simulates the bankers algorithm used in operating systems to avoid deadlocks, and see what sequences of processes are "safe sequences"

Davidmenamm / Operating_Systems_Bankers_Algorithm Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Simulates the bankers algorithm used in operating systems to avoid deadlocks, and see what sequences of processes are "safe sequences"

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
src/com/company		src/com/company
DM_Bankers_Algorithm.iml		DM_Bankers_Algorithm.iml
readme.txt		readme.txt

Repository files navigation

David Mena
20 April 2020

The program successfully reproduces the Banker's Algorithm. It accepts as program parameters the number of processes and the number of resources, respectively in this order. The other necessary arguments for the algorithm are input by the user once the program starts.

When filling the matrix MAX or ALLOCATE, the user has to input each row separated by spaces, on every line. Further details are clearly mentioned in the code and console messages.