Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algorithms for scalable synchronization on shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
Computer organization & design: the hardware/software interface
Computer organization & design: the hardware/software interface
The communication requirements of mutual exclusion
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Nonatomic mutual exclusion with local spinning
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
Adaptive Mutual Exclusion with Local Spinning
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A Time Complexity Bound for Adaptive Mutual Exclusion
DISC '01 Proceedings of the 15th 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
Obstruction-Free Synchronization: Double-Ended Queues as an Example
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
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
Synchronization Algorithms and Concurrent Programming
Synchronization Algorithms and Concurrent Programming
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Tight RMR lower bounds for mutual exclusion and other problems
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Closing the complexity gap between mutual exclusion and FCFS mutual exclusion
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
The Weakest Failure Detector for Message Passing Set-Agreement
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Achieving causal and total ordering in publish/subscribe middleware with DSM
Proceedings of the 3rd workshop on Middleware for service oriented computing
Randomized mutual exclusion in O(log N / log log N) RMRs
Proceedings of the 28th ACM symposium on Principles of distributed computing
Ordenação de eventos baseada em DSM para middlewares publish/subscribe
Companion Proceedings of the XIV Brazilian Symposium on Multimedia and the Web
Brief announcement: acceleration by contention for shared memory mutual exclusion algorithms
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Group mutual exclusion in O(log n) RMR
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Proceedings of the 29th ACM SIGACT-SIGOPS 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
Fast local-spin abortable mutual exclusion with bounded space
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Specification and constant RMR algorithm for phase-fair reader-writer lock
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
An $O(1)$ RMRs Leader Election Algorithm
SIAM Journal on 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
Tight time-space tradeoff for mutual exclusion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A tight RMR lower bound for randomized mutual exclusion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Brief announcement: a tight RMR lower bound for randomized mutual exclusion
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
RMR-efficient randomized abortable mutual exclusion
DISC'12 Proceedings of the 26th international conference on Distributed Computing
An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We investigate the remote memory references (RMRs) complexity of deterministic processes that communicate by reading and writing shared memory in asynchronous cache-coherent and distributed shared-memory multiprocessors. We define a class of algorithms that we call order encoding. By applying information-theoretic arguments, we prove that every order encoding algorithm, shared by n processes, has an execution that incurs Ω(n log n) RMRs. From this we derive the same lower bound for the mutual exclusion, bounded counter and store/collect synchronization problems. The bounds we obtain for these problems are tight. It follows from the results of [10] that our lower bounds hold also for algorithms that can use comparison primitives and load-linked/store-conditional in addition to reads and writes. Our mutual exclusion lower bound proves a longstanding conjecture of Anderson and Kim.