Group mutual exclusion in O(log n) RMR

8 years 11 months ago
Group mutual exclusion in O(log n) RMR
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and Hadzilacos presented algorithms of O(n) remote memory references (RMR) and proved a matching lower bound, where n is the number of processes. We show that in the CC model, using registers and LL/SC variables, our algorithm achieves O(min(log n, k)) RMR, where k is the point contention, which is so far the best. Moreover, given a recent result of Attiya, Hendler and Woelfel showing that exclusion problems have a Ω(log n) RMR lower bound using registers, comparison primitives and LL/SC variables, our algorithm thus achieves the best theoretical bound. Categories and Subject Descriptors D [Software]: Programming Techniques—Concurrent Programming General Terms: Algorithms, Design, Performance, Theory
Vibhor Bhatt, Chien-Chung Huang
Added 16 Aug 2010
Updated 16 Aug 2010
Type Conference
Year 2010
Where PODC
Authors Vibhor Bhatt, Chien-Chung Huang
Comments (0)