skip to main content
research-article
Public Access

On ordering transaction commit

Published:27 February 2016Publication History
Skip Abstract Section

Abstract

In this poster paper, we briefly introduce an effective solution to address the problem of committing transactions enforcing a predefined order. To do that, we overview the design of two algorithms that deploy a cooperative transaction execution that circumvents the transaction isolation constraint in favor of propagating written values among conflicting transactions. A preliminary implementation shows that even in the presence of data conflicts, the proposed algorithms outperform other competitors, significantly.

References

  1. RSTM: The University of Rochester STM. http://www.cs.rochester.edu/research/synchronization/rstm/.Google ScholarGoogle Scholar
  2. L. Dalessandro, M. F. Spear, and M. L. Scott. Norec: Streamlining stm by abolishing ownership records. In PPoPP, pages 67--78, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. Dice, O. Shalev, and N. Shavit. Transactional Locking II. In DISC, pages 194--208, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Gonzalez-Mesa, E. Gutierrez, E. L. Zapata, and O. Plata. Effective transactional memory execution management for improved concurrency. ACM TACO, 11(3):24, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. In ISCA, pages 289--300, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. L. Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16 (2):133--169, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Mehrara, J. Hao, P.-C. Hsu, and S. Mahlke. Parallelizing sequential applications on commodity hardware using a low-cost software transactional memory. In PLDI, pages 166--176, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Y. Raz. The principle of commitment ordering, or guaranteeing serializability in a heterogeneous environment of multiple autonomous resource managers using atomic commitment. In VLDB, volume 92, pages 292--312, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv., 22(4):299--319, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. L. Zhang, V. K. Grover, M. M. Magruder, D. Detlefs, J. J. Duffy, and G. Graefe. Software transaction commit order and conflict management, May 4 2010. US Patent 7,711,678.Google ScholarGoogle Scholar

Index Terms

  1. On ordering transaction commit

        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 51, Issue 8
          PPoPP '16
          August 2016
          405 pages
          ISSN:0362-1340
          EISSN:1558-1160
          DOI:10.1145/3016078
          Issue’s Table of Contents
          • cover image ACM Conferences
            PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
            February 2016
            420 pages
            ISBN:9781450340922
            DOI:10.1145/2851141

          Copyright © 2016 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 27 February 2016

          Check for updates

          Qualifiers

          • research-article

        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!