Skip to main content
SpringerLink
Log in

Fast and Scalable Mutual Exclusion

  • Conference paper
  • First Online:
Distributed Computing (DISC 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1693))

Included in the following conference series:

Abstract

We present an N-process algorithm for mutual exclusion un- der read/write atomicity that has O(1) time complexity in the absence of contention and Θ(log N) time complexity under contention, where “time” is measured by counting remote memory references. This is the first such algorithm to achieve these time complexity bounds. Our algo- rithm is obtained by combining a new “fast-path” mechanism with an arbitration-tree algorithm presented previously by Yang and Anderson.

Abstract

Work supported by NSF grant CCR 9732916. The first author was also supported by an Alfred P. Sloan Research Fellowship.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Anderson. The performance of spin lock alternatives for shared-memory multi-processors. IEEE Trans. on Parallel and Distributed Sys., 1(1):6–16, 1990.

    Article  Google Scholar 

  2. R. Cypher. The communication requirements of mutual exclusion. In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures, pages 147–156, 1995.

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  5. L. Lamport. A fast mutual exclusion algorithm. ACM Trans. on Computer Sys., 5(1):1–11, 1987.

    Article  Google Scholar 

  6. J. Mellor-Crummey and M. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. on Computer Sys., 9(1):21–65, 1991.

    Article  Google Scholar 

  7. M. Moir and J. Anderson. Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming, 25(1):1–39, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  8. J.-H. Yang and J. Anderson. Fast, scalable synchronization with minimal hardware support. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pages 171–182. 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of North Carolina at Chapel Hill, USA

    James H. Anderson & Yong-Jik Kim

Authors
  1. James H. Anderson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yong-Jik Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department for Computer Science 6211 Sudikoff Laboratory for Computer Science, Dartmouth College, Hanover, NH, 03755, USA

    Prasad Jayanti

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anderson, J.H., Kim, YJ. (1999). Fast and Scalable Mutual Exclusion. In: Jayanti, P. (eds) Distributed Computing. DISC 1999. Lecture Notes in Computer Science, vol 1693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48169-9_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-48169-9_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66531-1

  • Online ISBN: 978-3-540-48169-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation