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.

[1]  James H. Anderson,et al.  Adaptive Mutual Exclusion with Local Spinning , 2000, DISC.

[2]  Hagit Attiya,et al.  Adaptive and efficient mutual exclusion , 2002, PODC '00.

[3]  James H. Anderson,et al.  A fine-grained solution to the mutual exclusion problem , 1993, Acta Informatica.

[4]  Manhoi Choy,et al.  Adaptive solutions to the mutual exclusion problem , 1993, PODC '93.

[5]  James H. Anderson,et al.  An improved lower bound for the time complexity of mutual exclusion , 2001, PODC.

[6]  Hagit Attiya,et al.  Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract) , 1998, PODC '98.

[7]  G. Taubenfeld,et al.  Results about fast mutual exclusion , 1992, [1992] Proceedings Real-Time Systems Symposium.

[8]  Leslie Lamport,et al.  A fast mutual exclusion algorithm , 1987, TOCS.

[9]  Yehuda Afek,et al.  Long lived adaptive splitter and applications , 2002, Distributed Computing.

[10]  Shreekant S. Thakkar,et al.  Synchronization algorithms for shared-memory multiprocessors , 1990, Computer.

[11]  Michael Merritt,et al.  Speeding Lamport's Fast Mutual Exclusion Algorithm , 1993, Inf. Process. Lett..

[12]  Hagit Attiya,et al.  Long-lived renaming made adaptive , 1999, PODC '99.

[13]  Michael L. Scott,et al.  Algorithms for scalable synchronization on shared-memory multiprocessors , 1991, TOCS.

[14]  Yehuda Afek,et al.  Long-lived adaptive collect with applications , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[15]  James H. Anderson,et al.  A new fast-path mechanism for mutual exclusion , 2001, Distributed Computing.

[16]  James H. Anderson,et al.  Fast and Scalable Mutual Exclusion , 1999, DISC.

[17]  Leslie Lamport,et al.  A new solution of Dijkstra's concurrent programming problem , 1974, Commun. ACM.

[18]  Mark Moir,et al.  Universal constructions for multi-object operations , 1995, PODC '95.

[19]  Eugene Styer.  Improving fast mutual exclusion , 1992, PODC '92.

[20]  James H. Anderson,et al.  A fast, scalable mutual exclusion algorithm , 1995, Distributed Computing.

[21]  Mark Moir,et al.  Wait-Free Algorithms for Fast, Long-Lived Renaming , 1995, Sci. Comput. Program..

[22]  James H. Anderson,et al.  A space- and time-efficient local-spin spin lock , 2002, Inf. Process. Lett..

[23]  Hagit Attiya,et al.  Adaptive and efficient mutual exclusion (extended abstract) , 2000, PODC.

[24]  Edsger W. Dijkstra,et al.  Solution of a problem in concurrent programming control , 1965, CACM.

[25]  James H. Anderson,et al.  A Time Complexity Bound for Adaptive Mutual Exclusion , 2001, DISC.

[26]  Thomas E. Anderson,et al.  The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors , 1990, IEEE Trans. Parallel Distributed Syst..

[27]  Michael Merritt,et al.  Computing with Infinitely Many Processes , 2000, DISC.