A DAG-based algorithm for distributed mutual exclusion

A token-based distributed mutual exclusion algorithm is presented. The algorithm assumes a fully connected, reliable physical network and a directed acyclic graph (DAG) structured logical network. The number of messages required to provide mutual exclusion is dependent upon the logical topology imposed on the nodes. Using the best topology, the algorithm attains comparable performance to a centralized mutual exclusion algorithm; i.e., three messages per critical section entry. The algorithm achieves minimal heavy-load synchronization delay and imposes very little storage overhead.<
>