Skip to main content
SpringerLink
Log in

Transaction Safe Nonblocking Data Structures

  • Conference paper
Distributed Computing (DISC 2007)

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

Included in the following conference series:

Abstract

This brief announcement focuses on interoperability of software transactions with ad hoc nonblocking algorithms. Specifically, we modify arbitrary nonblocking operations so that (1) they can be used both inside and outside transactions, (2) external uses serialize with transactions, and (3) internal uses succeed if and only if the surrounding transaction commits. Interoperability enables seemless integration with legacy code, atomic composition of nonblocking operations, and the equivalent of hand-optimized, closed nested transactions.

This work was supported in part by NSF grants CNS-0411127 and CNS-0615139, equipment support from Sun Microsystems Laboratories, and financial support from Intel and Microsoft.

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. Harris, T.L.: A Pragmatic Implementation of Non-Blocking Linked-Lists. In: 15th Intl. Symp. on Distributed Computing, Lisboa, Portugal (October 2001)

    Google Scholar 

  2. Herlihy, M., Moss, J.E.: Transactional Memory: Architectural Support for Lock-Free Data Structures. In: 20th Intl. Symp. on Computer Architecture, San Diego, CA (May 1993)

    Google Scholar 

  3. Marathe, V.J., Scherer III, W.N., Scott, M.L.: Adaptive Software Transactional Memory. In: 19th Intl. Symp. on Distributed Computing, Cracow, Poland (September 2005)

    Google Scholar 

  4. Michael, M.M., Scott, M.L.: Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. In: 15th ACM Symp. on Principles of Distributed Computing, Philadelphia, PA (May 1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Rochester, Rochester, NY 14627-0226 USA,  

    Virendra J. Marathe, Michael F. Spear & Michael L. Scott

Authors
  1. Virendra J. Marathe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael F. Spear
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael L. Scott
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Pelc

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marathe, V.J., Spear, M.F., Scott, M.L. (2007). Transaction Safe Nonblocking Data Structures . In: Pelc, A. (eds) Distributed Computing. DISC 2007. Lecture Notes in Computer Science, vol 4731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75142-7_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75142-7_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75141-0

  • Online ISBN: 978-3-540-75142-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation