The congenial talking philosophers problem in computer networks
Journal
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Journal Volume
1693
Pages
195-211
Date Issued
1999
Author(s)
Abstract
The design issues for asynchronous group mutual exclusion have been modeled as the Congenial Talking Philosophers, and solutions for shared-memory models have been proposed [4]. This paper presents an efficient and highly concurrent distributed algorithm for computer networks where processes communicate by message passing. © Springer-Verlag Berlin Heidelberg 1999.
Other Subjects
Message passing; Philosophical aspects; Design issues; Group mutual exclusion; Shared memory model; Computer networks
Type
conference paper