The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—This paper presents a new solution to the <it>group mutual exclusion</it> problem recently posed by Joung. In this problem, processes repeatedly request access to various “sessions.” It is required that distinct processes are not in different sessions concurrently, that multiple processes may be in the <it>same</it> session concurrently, and that each process that tries to enter a session is eventually able to do so. This problem is a generalization of the mutual exclusion and readers-writers problems. Our algorithm and its correctness proof are substantially simpler than Joung's. This simplicity is achieved by building upon known solutions to the more specific mutual exclusion problem. Our algorithm also has various advantages over Joung's, depending on the choice of mutual exclusion algorithm used. These advantages include admitting a process to its session in constant time in the absence of contention, spinning locally in Cache Coherent (CC) and Nonuniform Memory Access (NUMA) systems, and improvements in the complexity measures proposed by Joung.</p>
Mutual exclusion, local spinning, scalable, shared memory, synchronization.

P. Keane and M. Moir, "A Simple Local-Spin Group Mutual Exclusion Algorithm," in IEEE Transactions on Parallel & Distributed Systems, vol. 12, no. , pp. 673-685, 2001.
85 ms
(Ver 3.3 (11022016))