Adaptive solutions to the mutual exclusion problem

Algorithms for mutual exclusion that adapt to the current degree of contention are developed. Afilter and a leader election algorithm form the basic building blocks. The algorithms achieve system response times that are independent of the total number of processes and governed instead by the current degree of contention. The final algorithm achieves a constant amortized system response time.

[1]  Nancy A. Lynch,et al.  Fast allocation of nearby resources in a distributed system , 1980, STOC '80.

[2]  Richard Cole,et al.  The APRAM: incorporating asynchrony into the PRAM model , 1989, SPAA '89.

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

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

[5]  Maurice Herlihy,et al.  Contention in shared memory algorithms , 1993, JACM.

[6]  Gary L. Peterson.  A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables , 1983, TOPL.

[7]  G. S. Graham.  A New Solution of Dijkstra ' s Concurrent Programming Problem , 2022 .

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

[9]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[10]  Leslie Lamport,et al.  The mutual exclusion problem: part I—a theory of interprocess communication , 1986, JACM.

[11]  Karl Preisendanz,et al.  AT&T , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[12]  Maged M. Michael,et al.  Fast Mutual Exclusion, Even with Contention , 1993 .

[13]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[14]  J D Littler,et al.  A PROOF OF THE QUEUING FORMULA , 1961 .

[15]  N. Lynch,et al.  Timing-based mutual exclusion , 1992, [1992] Proceedings Real-Time Systems Symposium.

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

[17]  Yossi Matias,et al.  The QRQW PRAM: accounting for contention in parallel algorithms , 1994, SODA '94.

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

[19]  J. Little.  A Proof for the Queuing Formula: L = λW , 1961 .

[20]  Vassos Hadzilacos,et al.  A first-come-first-served mutual-exclusion algorithm with small communication variables , 1991, TOPL.

[21]  Ralph Grishman,et al.  The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer , 1983, IEEE Transactions on Computers.

[22]  Donald E. Knuth,et al.  Additional comments on a problem in concurrent programming control , 1966, CACM.

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

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