Ricart-Agrawala Algorithm Simulation

This is a simulation of the Ricart-Agrawala algorithm for distributed mutual exclusion. Each node can manually request access to the critical section. The algorithm ensures that only one node can be in the critical section at a time.

Legend:

RELEASED
WANTED
HELD

Node 1

State: RELEASED

Queue:

Empty

Replies Received (0/2):

Node 2

State: RELEASED

Queue:

Empty

Replies Received (0/2):

Node 3

State: RELEASED

Queue:

Empty

Replies Received (0/2):

Message Log

No messages exchanged yet