Asynchronous group mutual exclusion in ring networks

In group mutual exclusion solutions, shared memory models and complete message passing networks have been proposed. These solutions, however, cannot be straightforwardly and efficiently converted to ring networks where each process can only communicate directly with its two neighbouring processes. As rings are also a popular network topology, the paper is focused on ring networks. An efficient and highly concurrent distributed algorithm for the problem is presented