Article

Free access

A simple local-spin group mutual exclusion algorithm

Authors:

Patrick Keane,

Mark MoirAuthors Info & Claims

PODC '99: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing

Pages 23 - 32

https://doi.org/10.1145/301308.301319

Published: 01 May 1999 Publication History

PDF eReader

References

[1]

Y. Afek, D. Dauber, and D. Touitou. Wait-free made fast. In Proceedings of the ~Yth Annual A CM Symposium on Theory of Computing, pp. 538-547, 1995.

Digital Library

Google Scholar

[2]

Y. Afek, D. Dolev, E. Gafni, M. Merritt, and N. Shavit. A bounded first-in, first-enabled solution to the ~-exclusion problem. A CM Transactions on Programming Languages and Systems, 16(3):939-953, 1994.

Digital Library

Google Scholar

[3]

J. Anderson and M. Moir. Universal constructions for large objects. In Proceedings of the 9th Annual International Workshop on Distributed Algorithms, pp. 168-182, 1995.

Digital Library

Google Scholar

[4]

J. Anderson and M. Moir. Using local-spin kexclusion algorithms to improve wait-free object implementations. Distributed Computing, 11'1- 20, 1997. A preliminary version appeared in Proceedings of the 13th Annual A CM Symposium on Principles of Distributed Computing, 1994, pp. 141-150.

Digital Library

Google Scholar

[5]

T. Anderson. The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 1(1):6-16, 1990.

Digital Library

Google Scholar

[6]

P.J. Courtois, F. Heymans, and D.L. Parnas. Concurrent control with readers and writers. Communications of the ACM, 14(10):667-668, 1971.

Digital Library

Google Scholar

[7]

E. Dijkstra. Solution to a problem in concurrent programming control. Communications of the A CM, 8(9):569, 1965.

Digital Library

Google Scholar

[8]

M. Fischer, N. Lynch, J. Burns, and A. Borodin. Resource allocation with immunity to process failure. In Proceedings of the ~Oth Annual IEEE Symposium on the Foundations of Computer Science, pp. 234-254, 1979.

Digital Library

Google Scholar

[9]

M. Fischer, N. Lynch, j. Burns, and A. Borodin. Distributed fifo allocation of identical resources using small shared space. A CM Transactions on Programming Languages and Systems, 11 (1):90- 114, 1989.

Digital Library

Google Scholar

[10]

G. Graunke and S. Thakkar. Synchronization algorithms for shared-memory multiprocessors. IEEE Computer, 23:60-69, 1990.

Digital Library

Google Scholar

[11]

M. Herlihy. A methodology for implementing highly concurrent data objects. A CM Transactions on Programming Languages and Systems, 15(5):745-770, 1993.

Digital Library

Google Scholar

[12]

Y.-J. Joung. Asynchronous group mutual exclusion. In Proceedings of the 17th Annual A CM Symposium on the Principles of Distributed Computing, pp. 51-60, 1998.

Digital Library

Google Scholar

[13]

P. Keane and M. Moir. A Simple Local-Spin Group Mutual Exclusion Algorithm. Technical Report #TR99-O~, University of Pittsburgh, Department of Computer Science, 1999.

Digital Library

Google Scholar

[14]

L. Lamport. The mutual exclusion problem: Part II- statement and solutions. Journal of the A CM, 33(2):327-348, 1986.

Digital Library

Google Scholar

[15]

L. Lamport. A fast mutual exclusion algorithm. A CM Transactions on Computer Systems, 5(1):1-11, 1987.

Digital Library

Google Scholar

[16]

J. Mellor-Crummey and M. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. A CM Transactions on Computer Systems, 9(1):21-65, 1991.

Digital Library

Google Scholar

[17]

M. Moir. Transparent support for wait-free transactions. In Proceedings of the 11th lnternational Workshop on Distributed Algorithms, pp. 305-319, 1997.

Digital Library

Google Scholar

[18]

J.-H. Yang and J. Anderson. A fast, scalable mutual exclusion algorithm. Distributed Computing, 9:51-60, 1995.

Digital Library

Google Scholar

Cited By

View all

Raynal MTaubenfeld G(2022)A visit to mutual exclusion in seven datesTheoretical Computer Science10.1016/j.tcs.2022.03.030919(47-65)Online publication date: Jun-2022
https://doi.org/10.1016/j.tcs.2022.03.030
Aravind A(2020)Symmetric Tokens based Group Mutual ExclusionWorkshop Proceedings of the 49th International Conference on Parallel Processing10.1145/3409390.3409395(1-10)Online publication date: 17-Aug-2020
https://dl.acm.org/doi/10.1145/3409390.3409395
Aravind AHesselink W(2019)Group Mutual Exclusion by Fetch-and-incrementACM Transactions on Parallel Computing10.1145/33092025:4(1-29)Online publication date: 22-Feb-2019
https://dl.acm.org/doi/10.1145/3309202
Show More Cited By

Index Terms

A simple local-spin group mutual exclusion algorithm
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

A note on group mutual exclusion
PODC '01: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing

Group mutual exclusion is a natural problem, formulated by Joung in 1998, that generalises the classical mutual exclusion problem. In group mutual exclusion a process requests a “session” before entering its critical section; processes are allowed to be ...
A Simple Local-Spin Group Mutual Exclusion Algorithm

This paper presents a new solution to the group mutual exclusion problem recently posed by Joung. In this problem, processes repeatedly request access to various sessions. It is required that distinct processes are not in different sessions concurrently,...
Fair group mutual exclusion
PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing

In the group mutual exclusion problem [6], which generalizes mutual exclusion [2], a process chooses a session when it requests entry to the Critical Section. A group mutual exclusion algorithm must ensure that the mutual exclusion property holds: If ...

Comments

Information & Contributors

Information

Published In

PODC '99: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing

May 1999

286 pages

ISBN:1581130996

DOI:10.1145/301308

Chairmen:
Brian Coan
Bellcore, Morristown, NJ
,
Jennifer Welch
Texas A & M Univ., College Station

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC99

Sponsor:

PODC99: ACM Symposium on Principles of Distributed Computing

May 4 - 6, 1999

Georgia, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
555
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)5

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Raynal MTaubenfeld G(2022)A visit to mutual exclusion in seven datesTheoretical Computer Science10.1016/j.tcs.2022.03.030919(47-65)Online publication date: Jun-2022
https://doi.org/10.1016/j.tcs.2022.03.030
Aravind A(2020)Symmetric Tokens based Group Mutual ExclusionWorkshop Proceedings of the 49th International Conference on Parallel Processing10.1145/3409390.3409395(1-10)Online publication date: 17-Aug-2020
https://dl.acm.org/doi/10.1145/3409390.3409395
Aravind AHesselink W(2019)Group Mutual Exclusion by Fetch-and-incrementACM Transactions on Parallel Computing10.1145/33092025:4(1-29)Online publication date: 22-Feb-2019
https://dl.acm.org/doi/10.1145/3309202
Platz KMittal NVenkatesan S(2019)Concurrent Unrolled Skiplist2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS.2019.00157(1579-1589)Online publication date: Jul-2019
https://doi.org/10.1109/ICDCS.2019.00157
Nemitz CAmert TAnderson J(2019)Real-time multiprocessor locks with nestingReal-Time Systems10.1007/s11241-019-09328-w55:2(296-348)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1007/s11241-019-09328-w
He YGopalakrishnan KGafni E(2016)Group mutual exclusion in linear time and spaceProceedings of the 17th International Conference on Distributed Computing and Networking10.1145/2833312.2833316(1-10)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1145/2833312.2833316
Wu WZhang JLuo ACao J(2015)Distributed Mutual Exclusion Algorithms for Intersection Traffic ControlIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2013.229709726:1(65-74)Online publication date: Jan-2015
https://doi.org/10.1109/TPDS.2013.2297097
Aoxueluo Wu WCao JRaynal M(2013)A Generalized Mutual Exclusion Problem and Its AlgorithmProceedings of the 2013 42nd International Conference on Parallel Processing10.1109/ICPP.2013.39(300-309)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.1109/ICPP.2013.39
Swaroop ASingh A(2012)From mutual exclusion to group mutual exclusion: A token-based general scheme2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing10.1109/PDGC.2012.6449896(645-650)Online publication date: Dec-2012
https://doi.org/10.1109/PDGC.2012.6449896
Kim YAnderson J(2012)A time complexity lower bound for adaptive mutual exclusionDistributed Computing10.1007/s00446-011-0152-624:6(271-297)Online publication date: 1-Jan-2012
https://dl.acm.org/doi/10.1007/s00446-011-0152-6
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A note on group mutual exclusion