Shared-memory mutual exclusion: major research trends since 1986

Authors:
James H. Anderson;Yong-Jik Kim;Ted Herman
Affiliations:
Department of Computer Science, University of North Carolina at Chapel Hill;Department of Computer Science, University of North Carolina at Chapel Hill;Department of Computer Science, University of Iowa
Venue:
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Year:
2003

Citing 66
Cited 42

The mutual exclusion problem: part I—a theory of interprocess communication

Journal of the ACM (JACM)
The mutual exclusion problem: partII—statement and solutions

Journal of the ACM (JACM)
Algorithms for mutual exclusion

Algorithms for mutual exclusion
A fast mutual exclusion algorithm

ACM Transactions on Computer Systems (TOCS)
Synchronization Algorithms for Shared-Memory Multiprocessors

Computer
Mutual exclusion revisited

JCIT Proceedings of the fifth Jerusalem conference on Information technology
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
A first-come-first-served mutual-exclusion algorithm with small communication variables

ACM Transactions on Programming Languages and Systems (TOPLAS)
Improving fast mutual exclusion

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Randomized mutual exclusion algorithms revisited

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Speeding Lamport's fast mutual exclusion algorithm

Information Processing Letters
Bounds on shared memory for mutual exclusion

Information and Computation
Time-adaptive algorithms for synchronization

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
High performance synchronization algorithms for multiprogrammed multiprocessors

PPOPP '95 Proceedings of the fifth 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
Wait-free algorithms for fast, long-lived renaming

Science of Computer Programming
Time/contention trade-offs for multiprocessor synchronization

Information and Computation
Long-lived renaming made fast

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Contention-free complexity of shared memory algorithms

Information and Computation
Scheduler-conscious synchronization

ACM Transactions on Computer Systems (TOCS)
An efficient recovery-based spin lock protocol for preemptive shared-memory multiprocessors

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
A Prioritized Multiprocessor Spin Lock

IEEE Transactions on Parallel and Distributed Systems
Contention in shared memory algorithms

Journal of the ACM (JACM)
A Comment on "A Circular List-Based Mutual Exclusion Scheme for Large Shared-Memory Multiprocessors"

IEEE Transactions on Parallel and Distributed Systems
Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Lower Bounds for Randomized Mutual Exclusion

SIAM Journal on Computing
Analysis of timing-based mutual exclusion with random times

Proceedings of the eighteenth 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
Long-lived renaming made adaptive

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fast, wait-free (2k-1)-renaming

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable

Journal of the ACM (JACM)
Adaptive and efficient mutual exclusion (extended abstract)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
A New Approach to Proving the Correctness of Multiprocess Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM
Concurrent control with “readers” and “writers”

Communications of the ACM
Additional comments on a problem in concurrent programming control

Communications of the ACM
Solution of a problem in concurrent programming control

Communications of the ACM
Scalable queue-based spin locks with timeout

PPoPP '01 Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming
An improved lower bound for the time complexity of mutual exclusion

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Self-stabilizing l-exclusion

Theoretical Computer Science
Nonatomic mutual exclusion with local spinning

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Non-blocking timeout in scalable queue-based spin locks

Proceedings of the twenty-first annual symposium on Principles of distributed computing
A space- and time-efficient local-spin spin lock

Information Processing Letters
Evaluating and Designing Software Mutual Exclusion Algorithms on Shared-Memory Multiprocessors

IEEE Parallel & Distributed Technology: Systems & Technology
The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
A Circular List-Based Mutual Exclusion Scheme for Large Shared-Memory Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Scalable Spin Locks for Multiprogrammed Systems

Proceedings of the 8th International Symposium on Parallel Processing
Queue Locks on Cache Coherent Multiprocessors

Proceedings of the 8th International Symposium on Parallel Processing
Fast, Long-Lived Renaming (Extended Abstract)

WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Deriving a Scalable Algorithm for Mutual Exclusion

DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
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
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Long-Lived Adaptive Collect with Applications

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Efficient Object Sharing in Quantum-Based Real-Time Systems

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Local-spin Mutual Exclusion Using Fetch-and-\phi Primitives

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Fast and Fair Mutual Exclusion for Shared Memory Systems

ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Fast Mutual Exclusion, Even with Contention

Fast Mutual Exclusion, Even with Contention
Mutual exclusion with linear waiting using binary shared variables

ACM SIGACT News
Long lived adaptive splitter and applications

Distributed Computing
Asynchronous group mutual exclusion

Distributed Computing
A new fast-path mechanism for mutual exclusion

Distributed Computing
Using local-spin k-exclusion algorithms to improve wait-free object implementations

Distributed Computing
Fast timing-based algorithms

Distributed Computing
Adaptive solutions to the mutual exclusion problem

Distributed Computing

Some myths about famous mutual exclusion algorithms

ACM SIGACT News
ACM SIGACT news distributed computing column 13

ACM SIGACT News
On the inherent weakness of conditional synchronization primitives

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Performance Evaluation of Task Pools Based on Hardware Synchronization

Proceedings of the 2004 ACM/IEEE conference on Supercomputing
A mutual exclusion algorithm with optimally bounded bypasses

Information Processing Letters
An O(1) RMRs leader election algorithm

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
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
Efficient adaptive collect using randomization

Distributed Computing - Special issue: DISC 04
On the inherent weakness of conditional primitives

Distributed Computing - Special issue: PODC 04
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model

Journal of Parallel and Distributed Computing
Efficient self-tuning spin-locks using competitive analysis

Journal of Systems and Software
Constant-RMR implementations of CAS and other synchronization primitives using read and write operations

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks

International Journal of Ad Hoc and Ubiquitous Computing
Tight RMR lower bounds for mutual exclusion and other problems

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Model checking transactional memories

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Closing the complexity gap between mutual exclusion and FCFS mutual exclusion

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Achieving causal and total ordering in publish/subscribe middleware with DSM

Proceedings of the 3rd workshop on Middleware for service oriented computing
Towards a real-time distributed computing model

Theoretical Computer Science
LFTHREADS: a lock-free thread library

ACM SIGARCH Computer Architecture News
Randomized mutual exclusion in O(log N / log log N) RMRs

Proceedings of the 28th ACM symposium on Principles of distributed computing
A mutual exclusion algorithm with optimally bounded bypasses

Information Processing Letters
LFTHREADS: a lock-free thread library

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Ordenação de eventos baseada em DSM para middlewares publish/subscribe

Companion Proceedings of the XIV Brazilian Symposium on Multimedia and the Web
On the existence of weakest failure detectors for mutual exclusion and k-exclusion

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
Brief announcement: locally-accessible implementations for distributed shared memory multiprocessors

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
Spin-based reader-writer synchronization for multiprocessor real-time systems

Real-Time Systems
A study of shared-memory mutual exclusion protocols using CADP

FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
Fast local-spin abortable mutual exclusion with bounded space

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
An $O(1)$ RMRs Leader Election Algorithm

SIAM Journal on Computing
Queue based mutual exclusion with linearly bounded overtaking

Science of Computer Programming
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
Cost of mutual exclusion with spin locks on multi-core CPUs

BICA'12 Proceedings of the 5th WSEAS congress on Applied Computing conference, and Proceedings of the 1st international conference on Biologically Inspired Computation
RMR-efficient randomized abortable mutual exclusion

DISC'12 Proceedings of the 26th international conference on Distributed Computing
Abortable reader-writer locks are no more complex than abortable mutex locks

DISC'12 Proceedings of the 26th international conference on Distributed Computing
An optimal k-exclusion real-time locking protocol motivated by multi-GPU systems

Real-Time Systems
Model checking and performance evaluation with CADP illustrated on shared-memory mutual exclusion protocols

Science of Computer Programming
Verifying safety and liveness for the FlexTM hybrid transactional memory

Proceedings of the Conference on Design, Automation and Test in Europe
Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

In 1986, Michel Raynal published a comprehensive survey of algorithms for mutual exclusion [72]. In this paper, we survey major research trends since 1986 in work on shared-memory mutual exclusion.