YUH-JZER JOUNG2020-02-112020-02-11199903029743https://scholars.lib.ntu.edu.tw/handle/123456789/457561https://www.scopus.com/inward/record.uri?eid=2-s2.0-84947902631&doi=10.1007%2f3-540-48169-9_14&partnerID=40&md5=f3a6801115579e880392b6164f6c90adThe 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.Message passing; Philosophical aspects; Design issues; Group mutual exclusion; Shared memory model; Computer networksconference paper2-s2.0-84947902631https://www.scopus.com/inward/record.uri?eid=2-s2.0-84947902631&partnerID=40&md5=9ca175c2b3a2fc248fed20f63d55a9cb