• Publications
  • Influence
Shared-memory mutual exclusion: major research trends since 1986
TLDR
In 1986, Michel Raynal published a comprehensive survey of algorithms for mutual exclusion [72]. Expand
  • 106
  • 10
  • PDF
An improved lower bound for the time complexity of mutual exclusion
TLDR
We establish 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. Expand
  • 45
  • 9
Fast and Scalable Mutual Exclusion
TLDR
We present an N-process algorithm for mutual exclusion under read/write atomicity that has O(1) time complexity in the absence of contention and Θ(logN)time complexity under contention, where "time" is measured by counting remote memory references. Expand
  • 30
  • 6
  • PDF
A Time Complexity Bound for Adaptive Mutual Exclusion
TLDR
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. Expand
  • 43
  • 5
  • PDF
Adaptive mutual exclusion with local spinning
TLDR
We present an adaptive algorithm for N-process mutual exclusion under read/write atomicity that is adaptive when time complexity is measured by counting remote memory references. Expand
  • 51
  • 4
  • PDF
A time complexity lower bound for adaptive mutual exclusion
TLDR
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. Expand
  • 8
  • 3
  • PDF
An improved lower bound for the time complexity of mutual exclusion
TLDR
We establish a lower bound of $\Omega(\log N/\log\log N)$ remote memory references for N-process mutual exclusion algorithms based on reads, writes, or comparison primitives such as test- and-set and compare-and-swap. Expand
  • 36
  • 2
  • PDF
A new fast-path mechanism for mutual exclusion
TLDR
We present a fast-path mechanism that allows the arbitration tree to be bypassed in the absence of contention when used in conjunction with Yang and Anderson's arbitration tree. Expand
  • 18
  • 2
  • PDF
Local-spin mutual exclusion using fetch-and-/spl phi/ primitives
TLDR
We present a generic fetch-and-/spl phi/-based local-spin mutual exclusion algorithm with O(1) time complexity under the RMR (remote-memory-reference) measure. Expand
  • 11
  • 2
Nonatomic mutual exclusion with local spinning
TLDR
We present an N-process local-spin mutual exclusion algorithm, based on nonatomic reads and writes, in which each process performs Θ(log N) remote memory references to enter and exit its critical section. Expand
  • 27
  • 1