Joung, Yuh-JzerYuh-JzerJoung2008-10-222018-06-292008-10-222018-06-29200201782770http://ntur.lib.ntu.edu.tw//handle/246246/84983https://www.scopus.com/inward/record.uri?eid=2-s2.0-0036649643&doi=10.1007%2fs004460100069&partnerID=40&md5=35257c7887ce717e75a2d6e2233f612aGroup mutual exclusion occurs naturally in situations where a resource can be shared by processes of the same group, but not by processes of different groups. For example, suppose data is stored in a CD-jukebox. Then when a disc is loaded for access, users that need data on the disc can concurrently access the disc, while users that need data on a different disc have to wait until the current disc is unloaded. The design issues for group mutual exclusion have been modeled as the Congenial Talking Philosophers problem, and solutions for shared-memory models have been proposed [12, 14]. As in ordinary mutual exclusion and many other problems in distributed systems, however, techniques developed for shared memory do not necessary apply to message passing (and vice versa). So in this paper we investigate solutions for Congenial Talking Philosophers in computer networks where processes communicate by asynchronous message passing. We first present a solution that is a straightforward adaptation from Ricart and Agrawala's algorithm for ordinary mutual exclusion. Then we show that the simple modification suffers a severe performance degradation that could cause the system to behave as though only one process of a group can be in the critical section at a time. We then present a more efficient and highly concurrent distributed algorithm for the problem, the first such solution in computer networks.application/pdf719278 bytesapplication/pdfen-USDistributed algorithms; Group mutual exclusion; Message passing; Mutual exclusion; Resource allocationAlgorithms; Computational complexity; Computer networks; Computer simulation; Data communication systems; Philosophical aspects; Resource allocation; Theorem proving; Congenial talking philosophers problem; Distributed algorithms; Group mutual exclusion; Message passing; Distributed computer systemsjournal article2-s2.0-0036649643http://ntur.lib.ntu.edu.tw/bitstream/246246/84983/1/3.pdf