Deadlock Avoidance

Banker's Algorithm

Simulate resource allocation to ensure the system remains in a Safe State.

Allocation

Max

Need

Available

System Ready. Initial Available Resources: [3, 3, 2]

Interactive Resource Request

Submit a custom resource request vector for any process to test the Banker's safety state.

Process:

Vector [A, B, C]:

Algorithm Rules

Need Matrix = Max Need - Current Allocation.
Safe State: A state is safe if the system can allocate resources to each process in some sequence up to their maximum and avoid deadlock.
The graph displays allocation (green lines) and request (dotted yellow lines) vectors.

Resource Allocation Graph (RAG)

Directed graph showing processes (circles) and resources (squares). Allocation edges point from Resource to Process; Request edges point from Process to Resource. Cycles are traced in glowing red.