Asynchronous group mutual exclusion in ring networks

In group mutual exclusion solutions for shared-memory models and complete m essage-passing networks have been proposed. These solutions: however, canno t be straightforwardly and efficiently converted to ring networks where eac h process can only communicate directly with its two neighbouring processes . As rings are also a popular network topology, the paper is focused on rin g networks. An efficient and highly concurrent distributed algorithm for th e problem is presented.