skip to main content
poster

Turbocharging boosted transactions or: how i learnt to stop worrying and love longer transactions

Published:14 February 2009Publication History
Skip Abstract Section

Abstract

Boosted transactions offer an attractive method that enables programmers to create larger transactions that scale well and offer deadlock-free guarantees. However, as boosted transactions get larger, they become more susceptible to conflicts and aborts. We describe a linear-time algorithm to detect transactions that cannot make progress, which transactions need to be aborted, and when. The algorithm guarantees zero false positives with minimal aborts. Our proposals, as implemented in DSTM2, increase the transactional throughput of the system, often by more than 30%.

References

  1. T. Harris, S. Marlow, S. Peyton-Jones, and M. Herlihy. Composable memory transactions. Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 48--60, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Herlihy and E. Koskinen. Transactional boosting: a methodology for highly-concurrent transactional objects. Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming, pages 207--216, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. E. Koskinen and M. Herlihy. Checkpoints and continuations instead of nested transactions. Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, pages 160--168, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. Mitchell and M. Merritt. A distributed algorithm for deadlock detection and resolution. Proceedings of the third annual ACM symposium on Principles of distributed computing, pages 282--284, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Turbocharging boosted transactions or: how i learnt to stop worrying and love longer transactions

      Recommendations

      Comments

      Login options

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

      Sign in

      Full Access

      • Published in

        cover image ACM SIGPLAN Notices
        ACM SIGPLAN Notices  Volume 44, Issue 4
        PPoPP '09
        April 2009
        294 pages
        ISSN:0362-1340
        EISSN:1558-1160
        DOI:10.1145/1594835
        Issue’s Table of Contents
        • cover image ACM Conferences
          PPoPP '09: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
          February 2009
          322 pages
          ISBN:9781605583976
          DOI:10.1145/1504176

        Copyright © 2009 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 14 February 2009

        Check for updates

        Qualifiers

        • poster
      • Article Metrics

        • Downloads (Last 12 months)2
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!