Asynchronous group mutual exclusion in ring networks

The design issues for group mutual exclusion have been modeled by Joung as the Congenial Talking Philosophers, and solutions for 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 philosopher can only communicate directly with its two neighboring philosophers. As rings are also a popular network topology, in this paper we focus the Congenial Talking Philosophers on ring networks and present an efficient and highly concurrent distributed algorithm for the problem.