research-article

Group mutual exclusion in O(log n) RMR

Authors:

Chien-Chung HuangAuthors Info & Claims

PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Pages 45 - 54

https://doi.org/10.1145/1835698.1835708

Published: 25 July 2010 Publication History

Abstract

We present an algorithm to solve the group mutual exclusion, problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and Hadzilacos presented algorithms of O(n) remote memory references (RMR) and proved a matching lower bound, where n is the number of processes. We show that in the CC model, using registers and LL/SC variables, our algorithm achieves O(min(log n,k)) RMR, where k is the point contention, which is so far the best. Moreover, given a recent result of Attiya, Hendler and Woelfel showing that exclusion problems have a Ω(log n) RME lower bound using registers, comparison primitives and LL/SC variables, our algorithm thus achieves the best theoretical bound.

References

[1]

J. Anderson and Y.-J. Kim. Adaptive mutual exclusion with local spinning. In In Proceedings of the 14th International Symposium on Distributed Computing, pages 29--43, 2001.

Digital Library

[2]

J. H. Anderson and Y.-J. Kim. Fast and scalable mutual exclusion. In Proceedings of the 13th International Symposium on Distributed Computing, pages 180--194, London, UK, 1999. Springer-Verlag.

Digital Library

[3]

J. H. Anderson and Y.-J. Kim. An improved lower bound for the time complexity of mutual exclusion. Distrib. Comput., 15(4):221--253, 2002.

Digital Library

[4]

J. H. Anderson, Y.-J. Kim, and T. Herman. Shared-memory mutual exclusion: major research trends since 1986. Distrib. Comput., 16(2-3):75--110, 2003.

Digital Library

[5]

T. E. Anderson. The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Parallel Distrib. Syst., 1(1):6--16, 1990.

Digital Library

[6]

H. Attiya and V. Bortnikov. Adaptive and efficient mutual exclusion (extended abstract). In PODC '00: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, pages 91--100, New York, NY, USA, 2000. ACM.

Digital Library

[7]

H. Attiya, D. Hendler, and P. Woelfel. Tight RMR lower bounds for mutual exclusion and other problems. In STOC '08: Proceedings of the 40th annual ACM symposium on Theory of computing, pages 217--226, New York, NY, USA, 2008. ACM.

Digital Library

[8]

V. Bhatt and P. Jayanti. Constant RMR solutions to reader writer synchronization. To appear in PODC '10 : Proceedings of the Twenty-Ninth annual symposium on Principles of distributed computing.

Digital Library

[9]

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

Digital Library

[10]

T. Craig. Queuing spin lock algorithms to support timing predictability. In Proceedings of the 14th IEEE Real-time Systems Symposium, pages 148--156. IEEE, 1993.

[11]

R. Cypher. The communication requirements of mutual exclusion. In SPAA '95: Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, pages 147--156, New York, NY, USA, 1995. ACM.

Digital Library

[12]

E. W. Dijkstra. Solution of a problem in concurrent programming control. Commun. ACM, 8(9):569, 1965.

Digital Library

[13]

R. Fan and N. Lynch. An Ω (n log n) lower bound on the cost of mutual exclusion. In PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, pages 275--284, New York, NY, USA, 2006. ACM.

Digital Library

[14]

G. Granunke and S. Thakkar. Synchronization algorithms for shared-memory multiprocessors. Computer, 23(6):60--69, 1990.

Digital Library

[15]

V. Hadzilacos. A note on group mutual exclusion. In PODC '01: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, pages 100--106, New York, NY, USA, 2001. ACM.

Digital Library

[16]

V. Hadzilacos and R. Danek. Local-spin group mutual exclusion algorithms. In DISC'04: Proceedings of the 18th International Symposium on Distributed Computing, pages 71--85. Springer Berlin / Heidelberg, 2004.

[17]

D. Hendler and P. Woelfel. Randomized mutual exclusion in Ω(log n / log log n) RMRs. In PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing, pages 26--35, New York, NY, USA, 2009. ACM.

Digital Library

[18]

P. Jayanti. f-arrays: implementation and applications. In Proceedings of the 21st Annual Symposium on Principles of Distributed Computing, pages 270--279, 2002.

Digital Library

[19]

P. Jayanti. Adaptive and efficient abortable mutual exclusion. In PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing, pages 295--304, New York, NY, USA, 2003. ACM.

Digital Library

[20]

P. Jayanti and S. Petrovic. Efficient and practical constructions of ll/sc variables. In PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing, pages 285--294, New York, NY, USA, 2003. ACM.

Digital Library

[21]

P. Jayanti, S. Petrovic, and K. Tan. Fair group mutual exclusion. In PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing, pages 275--284, New York, NY, USA, 2003. ACM.

Digital Library

[22]

Y.-J. Joung. Asynchronous group mutual exclusion (extended abstract). In PODC '98: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, pages 51--60, New York, NY, USA, 1998. ACM.

Digital Library

[23]

P. Keane and M. Moir. A simple local-spin group mutual exclusion algorithm. In PODC '99: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, pages 23--32, New York, NY, USA, 1999. ACM.

Digital Library

[24]

L. Lamport. A new solution of Dijkstra's concurrent programming problem. Commun. ACM, 17(8):453--455, 1974.

Digital Library

[25]

J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst., 9(1):21--65, 1991.

Digital Library

[26]

J. M. Mellor-Crummey and M. L. Scott. Scalable reader-writer synchronization for shared-memory multiprocessors. In PPOPP '91: Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 106--113, New York, NY, USA, 1991. ACM.

Digital Library

[27]

M. Michael. Practical lock-free and wait-free ll/sc/vl implementations using 64-bit cas. In DISC'04: Proceedings of the 18th International Symposium on Distributed Computing, pages 144--158. Springer Berlin / Heidelberg, 2004.

[28]

M. Moir. Practical implementations of non-blocking synchronization primitives. In PODC '97: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, pages 219--228, New York, NY, USA, 1997. ACM.

Digital Library

[29]

J.-H. Yang and J. H. Anderson. A fast, scalable mutual exclusion algorithm. Distributed Computing, 9:9--1, 1994.

Cited By

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
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
Show More Cited By

Index Terms

Group mutual exclusion in O(log n) RMR
1. Computing methodologies
  1. Distributed computing methodologies
    1. Distributed programming languages
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Distributed programming languages

Recommendations

Constant RMR solutions to reader writer synchronization
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes - readers and writers - and multiple readers can be in the Critical Section (CS) at the same time, although no ...
Randomized mutual exclusion with sub-logarithmic RMR-complexity

Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references (RMRs) metric. Attiya, Hendler, and Woelfel (40th STOC, 2008) established ...
Randomized mutual exclusion in O(log N / log log N) RMRs
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing

Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references (RMRs) metric. A recent proof [9] established an Ω(log N) lower bound on ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

July 2010

494 pages

ISBN:9781605588889

DOI:10.1145/1835698

General Chairs:
Andrea Richa
Arizona State University, USA
,
Rachid Guerraoui
EPFL, Switzerland

Copyright © 2010 ACM.

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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PODC '10

Sponsor:

PODC '10: ACM Symposium on Principles of Distributed Computing

July 25 - 28, 2010

Zurich, Switzerland

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
233
Total Downloads

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

Reflects downloads up to 06 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

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
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
Elhadef M(2015)An Adaptable inVANETs-Based Intersection Traffic Control Algorithm2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing10.1109/CIT/IUCC/DASC/PICOM.2015.352(2387-2392)Online publication date: Oct-2015
https://doi.org/10.1109/CIT/IUCC/DASC/PICOM.2015.352
Wu SHuo Y(2014)Study on City T-Junction Design under Optimal ScenariosApplied Mechanics and Materials10.4028/www.scientific.net/AMM.587-589.2145587-589(2145-2150)Online publication date: Jul-2014
https://doi.org/10.4028/www.scientific.net/AMM.587-589.2145
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
Golab WGavoille CFraigniaud P(2011)A complexity separation between the cache-coherent and distributed shared memory modelsProceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing10.1145/1993806.1993822(109-118)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.1145/1993806.1993822

View Options

Get Access

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents