Group mutual exclusion in linear time and space

We present two algorithms for the Group Mutual Exclusion (GME) Problem that satisfy the properties of Mutual Exclusion, Starvation Freedom, Bounded Exit, Concurrent Entry and First Come First Served. Both our algorithms use only simple read and write instructions, have O(N) Shared Space complexity and O(N) Remote Memory Reference (RMR) complexity in the Cache Coherency (CC) model. Our first algorithm is developed by generalizing the well-known Lamport's Bakery Algorithm for the classical mutual exclusion problem, while preserving its simplicity and elegance. However, it uses unbounded shared registers. Our second algorithm uses only bounded registers and is developed by generalizing Taubenfeld's Black and White Bakery Algorithm to solve the classical mutual exclusion problem using only bounded shared registers. We show that contrary to common perception our algorithms are the first to achieve these properties with these combination of complexities.

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

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

[3]  Vassos Hadzilacos.  A note on group mutual exclusion , 2001, PODC '01.

[4]  Mark Moir,et al.  A simple local-spin group mutual exclusion algorithm , 1999, PODC '99.

[5]  Prasad Jayanti,et al.  Fair group mutual exclusion , 2003, PODC '03.

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

[7]  Eli Gafni,et al.  Group mutual exclusion in linear time and space , 2018, Theor. Comput. Sci..

[8]  Yuh-Jzer Joung,et al.  Asynchronous group mutual exclusion , 2000, Distributed Computing.

[9]  Y. Mukaigawa,et al.  Large Deviations Estimates for Some Non-local Equations I. Fast Decaying Kernels and Explicit Bounds , 2022 .

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

[11]  Gary L. Peterson,et al.  Myths About the Mutual Exclusion Problem , 1981, Inf. Process. Lett..

[12]  Leslie Lamport,et al.  The mutual exclusion problem: partII—statement and solutions , 1986, JACM.

[13]  Allan Borodin,et al.  Resource allocation with immunity to limited process failure , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[14]  Gadi Taubenfeld,et al.  The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms , 2004, DISC.

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

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

[17]  Vassos Hadzilacos,et al.  Local-Spin Group Mutual Exclusion Algorithms , 2004, DISC.

[18]  K. Gödel.  Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .

[19]  James Edward Burns.  Complexity of communication among asynchronous parallel processes , 1981 .

[20]  Michel Raynal.  The Mutual Exclusion Problem , 2013 .

[21]  Chien-Chung Huang,et al.  Group mutual exclusion in O(log n) RMR , 2010, PODC '10.

[22]  Yoshihide Igarashi,et al.  Highly Concurrent Group Mutual Exclusion Algorithms Based on Ticket Orders , 2003, IEICE Trans. Inf. Syst..

[23]  Atle Selberg.  An Elementary Proof of the Prime-Number Theorem , 1949 .

[24]  Prasad Jayanti,et al.  Bounding Lamport's Bakery Algorithm , 2001, SOFSEM.