Abstract

) Kuen-Pin Wu Department of Electrical Engineering National Taiwan University Taipei, Taiwan kpw@orchid.ee.ntu.edu.tw Yuh-Jzer Joung Department of Information Management National Taiwan University Taipei, Taiwan joung@ccms.ntu.edu.tw Abstract 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 [2, 3]. 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. 1 Introduction The design issues for mutual exclusion between groups of processes have recently been modeled by Joung [2] as the Con...

Citations