Banker's Algorithm Simulation

A website that describes the implementation of Banker's Algorithm using queue datastructure.

Banker's Algorithm is a resource allocation and deadlock avoidance algorithm that tests for safety by simulating the allocation of predetermined maximum possible amounts of all resources, and then makes an "safe-state" check to test for possible deadlock conditions for all other pending activities, before deciding whether allocation should be allowed to continue.

Description🧠

This project includes simulation of Banker's Algorithm using double queue implementation (proposed by us).

One button will be provided to the user on the home page along with two drop down option to select number of resources and number of processes for which program will be simulating the algorithm.

After that you will be directed to a page where you will be providing the resource values along with allocation and need of processes. (For testing purpose, you can refer to input1.txt and input2.txt)

Built With

This section should list any major frameworks/libraries used to bootstrap your project. Leave any add-ons/plugins for the acknowledgements section. Here are a few examples.

Run Demo💻

You can follow the steps provided below to start using this project:

Clone the repo

git clone https://github.com/sumit-6/Banker-s-Algorithm-Visualizer.git

Install virtualenv first:
```
pip install virtualenv
```
Create an environment using this command:
```
virtualenv env
```
Enter into your environment using this command:
```
env\Scripts\activate.bat
```
Install requirements.txt by running this command:
```
pip install -r requirements.txt
```
Run the project:
```
python app.py
```