ACM Transactions on Programming Languages and Systems (TOPLAS)
Algorithms for scalable synchronization on shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
Time/contention trade-offs for multiprocessor synchronization
Information and Computation
Long-lived renaming made adaptive
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Queue Locks on Cache Coherent Multiprocessors
Proceedings of the 8th International Symposium on Parallel Processing
An improved lower bound for the time complexity of mutual exclusion
Distributed Computing - Special issue: Selected papers from PODC '01
Local-spin Mutual Exclusion Using Fetch-and-\phi Primitives
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Time complexity bounds for shared-memory mutual exclusion
Time complexity bounds for shared-memory mutual exclusion
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 a generic fetch-and-@f-based local-spin mutual exclusion algorithm, with O(1) time complexity under the remote-memory-references time measure. This algorithm is ''generic'' in the sense that it can be implemented using any fetch-and-@f primitive of rank 2N, where N is the number of processes. The rank of a fetch-and-@f primitive is a notion introduced herein; informally, it expresses the extent to which processes may ''order themselves'' using that primitive. This algorithm breaks new ground because it shows that O(1) time complexity is possible using a wide range of primitives. In addition, by applying our generic algorithm within an arbitration tree, one can easily construct a @Q(max(1,log"rN)) algorithm using any primitive of rank r, where 2=