Adaptive mutual exclusion with local spinning

We present an adaptive algorithm for N-process mutual exclusion under read/write atomicity in which all busy waiting is by local spinning. In our algorithm, each process p performs O(k) remote memory references to enter and exit its critical section, where k is the maximum “point contention” experienced by p. The space complexity of our algorithm is Θ(N), which is clearly optimal. Our algorithm is the first mutual exclusion algorithm under read/write atomicity that is adaptive when time complexity is measured by counting remote memory references.

• Type: Journal
• Year: 2007
• Where: DC
• Authors: Yong-Jik Kim, James H. Anderson
• Keywords: Algorithm, DC 2001, DC 2007, Mutual Exclusion, N-process Mutual Exclusion