Algorithms for scalable synchronization on shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
Scalable reader-writer synchronization for shared-memory multiprocessors
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
The communication requirements of mutual exclusion
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Practical implementations of non-blocking synchronization primitives
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Asynchronous group mutual exclusion (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A simple local-spin group mutual exclusion algorithm
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Adaptive and efficient mutual exclusion (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Concurrent control with “readers” and “writers”
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
A note on group mutual exclusion
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
f-arrays: implementation and applications
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Fast and Scalable Mutual Exclusion
Proceedings of the 13th International Symposium on Distributed Computing
Adaptive Mutual Exclusion with Local Spinning
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
An improved lower bound for the time complexity of mutual exclusion
Distributed Computing - Special issue: Selected papers from PODC '01
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Efficient and practical constructions of LL/SC variables
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Adaptive and efficient abortable mutual exclusion
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
An Ω (n log n) lower bound on the cost of mutual exclusion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Tight RMR lower bounds for mutual exclusion and other problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Randomized mutual exclusion in O(log N / log log N) RMRs
Proceedings of the 28th ACM symposium on Principles of distributed computing
Constant RMR solutions to reader writer synchronization
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A complexity separation between the cache-coherent and distributed shared memory models
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
| Hi-index | 0.00 |
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) RME lower bound using registers, comparison primitives and LL/SC variables, our algorithm thus achieves the best theoretical bound.