Shared-memory mutual exclusion: major research trends since 1986

  title={Shared-memory mutual exclusion: major research trends since 1986},
  author={James H. Anderson and Yong-Jik Kim and Ted Herman},
  journal={Distributed Computing},
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. 
Caches, Transactions and Memories: Models, Coherence and Consistency
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.
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
Time complexity bounds for shared-memory mutual exclusion
This dissertation presents a generic fetch-and-p-based local-spin mutual exclusion algorithm with Θ(logr N) RMR time complexity, and shows that adaptive mutual exclusion is impossible in such systems by proving that any nonatomic algorithm must have a single-process execution that accesses Ω(log N/log log N) distinct variables.
A fair and space-efficient mutual exclusion
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.
Closing the complexity gap between mutual exclusion and FCFS mutual exclusion
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).
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
ACM SIGACT news distributed computing column 13
This issue describes the PODC 20th anniversary Special Issue published by Distributed Computing journal.
Adaptive randomized mutual exclusion in sub-logarithmic expected time
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.
A queue based mutual exclusion algorithm
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.


Bounds on Shared Memory for Mutual Exclusion
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.
A Comment on "A Circular List-Based Mutual Exclusion Scheme for Large Shared-Memory Multiprocessors"
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.
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
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
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
Contention in shared memory algorithms
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.
A Circular List-Based Mutual Exclusion Scheme for Large Shared-Memory Multiprocessors
  • S. Fu, N. Tzeng
  • Computer Science
    IEEE Trans. Parallel Distributed Syst.
  • 1997
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.
Scalable reader-writer synchronization for shared-memory multiprocessors
Reader-writer locks that similarly exploit locality to achieve scalability are presented, with variants for reader preference, writer preference, and reader-writer fairness.
A fast, scalable mutual exclusion algorithm
A new algorithm forN-process mutual exclusion that requires only read and write operations and that hasO(logN) time complexity, where “time” is measured by counting remote memory references.