Shared-memory mutual exclusion: major research trends since 1986

@article{Anderson2003SharedmemoryME,
  title={Shared-memory mutual exclusion: major research trends since 1986},
  author={James H. Anderson and Yong-Jik Kim and T. Herman},
  journal={Distributed Computing},
  year={2003},
  volume={16},
  pages={75-110}
}
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. 
View on Springer
cs.unc.edu
102 Citations
Highly Influential Citations
10
Background Citations
47
Methods Citations
20

102 Citations

Citation Type

Citation Type

Caches, Transactions and Memories: Models, Coherence and Consistency
TLDR
A mobile application that automates the very labor-intensive and therefore time-heavy and expensive process of manually cataloging and cataloging the contents of a computer for the first time. Expand
Transformations of Mutual Exclusion Algorithms from the Cache-Coherent Model to the Distributed Shared Memory Model
  • Hyonho Lee
  • Computer Science
  • 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05)
  • 2005
We present two transformations that convert a class of local-spin mutual exclusion algorithms on the cache-coherent model to local-spin mutual exclusion algorithms on the distributed shared memory… Expand
Time complexity bounds for shared-memory mutual exclusion
Mutual exclusion algorithms are used to resolve conflicting accesses to shared resources by concurrent processes. The problem of designing such an algorithm is widely regarded as one of the “classic”… Expand
A fair and space-efficient mutual exclusion
TLDR
This paper presents a bounded-bypass algorithm using only two shared variables, regardless of the number of contending processes, by operation fetch&store as well as atomic read/write, and shows that this algorithm is space-optimal. Expand
Closing the complexity gap between mutual exclusion and FCFS mutual exclusion
TLDR
This work exhibits an upper bound of O(log N) RMRs for FCFS ME, which is tight, improves on prior results, and matches a lower bound for ME (with or without FCFS). Expand
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
TLDR
A lower bound of three on remote reference time complexity for mutual exclusion algorithms in a model where processes communicate by means of a general read-modify-write primitive that accesses at most one shared variable in one instruction is established. Expand
A mutual exclusion algorithm with optimally bounded bypasses
TLDR
A modified algorithm that transforms the number stages to be crossed from fixed n-1 to t, where 1=1=1 is proposed. Expand
ACM SIGACT news distributed computing column 13
TLDR
This issue describes the PODC 20th anniversary Special Issue published by Distributed Computing journal. Expand
Adaptive randomized mutual exclusion in sub-logarithmic expected time
TLDR
This work presents a randomized adaptive mutual exclusion algorithms with O(log k/loglog k) expected amortized RMR complexity, even against a strong adversary, for the cache-coherent shared memory read/write model and establishes that sub-logarithmic adaptive Mutual exclusion, using reads and writes only, is possible. Expand
A queue based mutual exclusion algorithm
TLDR
This work proves mutual exclusion by reformulating the algorithm as a transition system (automaton), and applying simulation of automata, and proves that no competing process is passed by any other process more than once. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 91 REFERENCES
Bounds on Shared Memory for Mutual Exclusion
TLDR
It is shown that n binary shared variables are necessary and sufficient to solve the problem of mutual exclusion with guaranteed global progress for n processes using only atomic reads and writes of shared variables for communication. Expand
A Comment on "A Circular List-Based Mutual Exclusion Scheme for Large Shared-Memory Multiprocessors"
TLDR
A modified version of the circular list-based mutual exclusion algorithm proposed by Fu and Tzeng (1997) is provided, subject to a race condition that leads to a deadlock under subtle situations. Expand
A fast mutual exclusion algorithm
A new solution to the mutual exclusion problem is presented that, in the absence of contention, requires only seven memory accesses. It assumes atomic reads and atomic writes to shared registers.
Speeding Lamport's Fast Mutual Exclusion Algorithm
TLDR
A linked list is used to speed up a mutual exclusion algorithm by allowing scans of the list to be concurrent with insertions and deletions of list entries. Expand
A Time Complexity Bound for Adaptive Mutual Exclusion
We consider the time complexity of adaptive mutual exclusion algorithms, where "time" is measured by counting the number of remote memory references required per critical-section access. We establish… Expand
Mutual exclusion with linear waiting using binary shared variables
  • J. Burns
  • Computer Science, Mathematics
  • SIGA
  • 1978
TLDR
Upper and lower bounds of N+1 and N shared binary variables, respectively, are shown for the problem of mutual exclusion with linear waiting forLockout-free mutual exclusion is shown to require at least N sharedbinary variables when the primitive operations are suitably restricted. Expand
An improved lower bound for the time complexity of mutual exclusion
TLDR
A lower bound of O(log N/log log N) remote memory references for N-process mutual exclusion algorithms based on reads, writes, or comparison primitives is established. Expand
Mutual exclusion revisited
  • B. Szymanski
  • Computer Science
  • Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'
  • 1990
A family of four mutual exclusion algorithms is presented. Its members vary from a simple three-bit linear wait mutual exclusion to the four-bit first-come first-served algorithm immune to various… Expand
Contention in shared memory algorithms
TLDR
The first formal complexity model for contention in shared-memory multiprocessors is introduced and certain counting networks outperform conventional single-variable counters at high levels of contention, providing the first formal model explaining this phenomenon. Expand
A Circular List-Based Mutual Exclusion Scheme for Large Shared-Memory Multiprocessors
  • S. Fu, N. Tzeng
  • Computer Science
  • IEEE Trans. Parallel Distributed Syst.
  • 1997
TLDR
An efficient scheme is introduced which keeps synchronization traffic low and avoids serious hot-spot contention in shared-memory multiprocessors, and achieves better performance than prior techniques, with its elapsed time close to the lower bound for the whole range of simulated system sizes, thus promising good scalability for large systems. Expand
...
1
2
3
4
5
...