Skip to main content
SpringerLink
Log in

Brief Announcement: Fast Local-Spin Abortable Mutual Exclusion with Bounded Space

  • Conference paper
Distributed Computing (DISC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6343))

Included in the following conference series:

  • 1087 Accesses

Abstract

Abortable mutual exclusion is a variant of classical mutual exclusion, in which a process performing a trying protocol to enter the critical section (CS) is allowed to stop waiting for the CS to become available, by performing an abort protocol that takes a bounded number of steps.

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

References

  1. Danek, R., Lee, H.: Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 512–513. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Detlefs, D.L., Martin, P.A., Moir, M., Steele Jr., G.L.: Lock-Free Reference Counting. In: The 20th Annual ACM Symposium on Principles of Distributed Computing, pp. 190–199 (2001)

    Google Scholar 

  3. Jayanti, P.: Adaptive and Efficient Abortable Mutual Exclusion. In: Proceedings of the 22th Annual ACM Symposium on Principles of Distributed Computing (July 2003)

    Google Scholar 

  4. Scott, M.L.: Non-blocking Timeout in Scalable Queue-based Spin Locks. In: The 21st Annual Symposium on Principles of Distributed Computing (July 2002)

    Google Scholar 

  5. Valois, J.D.: Lock-Free Linked Lists Using Compare-and-Swap. In: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 214–222 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, Toronto, ON, Canada, M5S 3G4

    Hyonho Lee

Authors
  1. Hyonho Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, 02139-4307, Cambridge, MA, USA

    Nancy A. Lynch

  2. Computer Science and Engineering, University of Connecticut, 371 Fairfield Way, Unit 2155, 06269, Storrs, CT, USA

    Alexander A. Shvartsman

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, H. (2010). Brief Announcement: Fast Local-Spin Abortable Mutual Exclusion with Bounded Space. In: Lynch, N.A., Shvartsman, A.A. (eds) Distributed Computing. DISC 2010. Lecture Notes in Computer Science, vol 6343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15763-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15763-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15762-2

  • Online ISBN: 978-3-642-15763-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation