research-article

Public Access

Processing transactions in a predefined order

Authors:

Mohamed M. Saad,

Masoomeh Javidi Kishi,

Roberto PalmieriAuthors Info & Claims

PPoPP '19: Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming

Pages 120 - 132

https://doi.org/10.1145/3293883.3295730

Published: 16 February 2019 Publication History

Abstract

In this paper we provide a high performance solution to the problem of committing transactions while enforcing a pre-defined order. We provide the design and implementation of three algorithms, which deploy a specialized cooperative transaction execution model. This model permits the propagation of written values along the chain of ordered transactions. We show that, even in the presence of data conflicts, the proposed algorithms outperform single threaded execution, and other baseline and specialized state-of-the-art competitors (e.g., STMLite). The maximum speedup achieved in micro benchmarks, STAMP, PARSEC and SPEC200 applications is in the range of 4.3x -- 16.5x.

References

[1]

2010. RSTM: The University of Rochester STM. http://www.cs.rochester.edu/research/synchronization/rstm/.

[2]

Hagit Attiya, Alexey Gotsman, Sandeep Hans, and Noam Rinetzky. 2014. Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient. In DISC. 376--390.

[3]

Joao Barreto, Aleksandar Dragojevic, Paulo Ferreira, Ricardo Filipe, and Rachid Guerraoui. 2012. Unifying thread-level speculation and transactional memory. In Proceedings of the 13th International Middleware Conference. Springer-Verlag New York, Inc., 187--207.

Digital Library

[4]

Philip A Bernstein, Vassos Hadzilacos, and Nathan Goodman. 1987. Concurrency control and recovery in database systems. Addison-Wesley.

Digital Library

[5]

Anasua Bhowmik and Manoj Franklin. 2002. A general compiler framework for speculative multithreading. In Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures (SPAA '02). ACM, New York, NY, USA, 99--108.

Digital Library

[6]

Trevor Brown, Alex Kogan, Yossi Lev, and Victor Luchangco. 2016. Investigating the Performance of Hardware Transactions on a Multi-Socket Machine. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, Christian Scheideler and Seth Gilbert (Eds.). ACM, 121--132.

Digital Library

[7]

Luke Dalessandro and Michael L. Scott. 2012. Sandboxing Transactional Memory. In Proceedings of the 21st International Conference on Parallel Architectures and Compilation Techniques (PACT '12). ACM, New York, NY, USA, 171--180.

Digital Library

[8]

Luke Dalessandro, Michael F. Spear, and Michael L. Scott. 2010. NOrec: Streamlining STM by Abolishing Ownership Records. In PPoPP. 67--78.

Digital Library

[9]

Henry Daly, Ahmed Hassan, Michael F. Spear, and Roberto Palmieri. 2018. NUMASK: High Performance Scalable Skip List for NUMA. In 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018 (LIPIcs), Ulrich Schmid and Josef Widder (Eds.), Vol. 121. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 18:1--18:19.

[10]

Dave Dice, Ori Shalev, and Nir Shavit. 2006. Transactional Locking II. In DISC. 194--208.

Digital Library

[11]

Simon Doherty, Lindsay Groves, Victor Luchangco, and Mark Moir. 2013. Towards formally specifying and verifying Transactional Memory. Formal Aspects of Computing 25, 5 (2013), 769--799.

Digital Library

[12]

Pascal Felber, Christof Fetzer, and Torvald Riegel. 2008. Dynamic performance tuning of word-based software transactional memory. In PPoPP. 237--246.

Digital Library

[13]

MA Gonzalez-Mesa, Eladio Gutierrez, Emilio L Zapata, and Oscar Plata. 2014. Effective Transactional Memory Execution Management for Improved Concurrency. ACM TACO 11, 3 (2014), 24.

Digital Library

[14]

Rachid Guerraoui and Michal Kapalka. 2008. On the correctness of transactional memory. In PPoPP. 175--184.

Digital Library

[15]

R. Guerraoui and M. Kapalka. 2011. Principles of Transactional Memory. Morgan & Claypool.

Digital Library

[16]

Danny Hendler, Itai Incze, Nir Shavit, and Moran Tzafrir. 2010. Flat combining and the synchronization-parallelism tradeoff. In SPAA. 355--364.

Digital Library

[17]

Maurice Herlihy and J. Eliot B. Moss. 1993. Transactional Memory: Architectural Support for Lock-Free Data Structures. In ISCA. 289--300.

Digital Library

[18]

Sachin Hirve, Roberto Palmieri, and Binoy Ravindran. 2014. Archie: a speculative replicated transactional system. In Proceedings of the 15th International Middleware Conference, Bordeaux, France, December 8-12, 2014. 265--276.

Digital Library

[19]

Manos Kapritsos, Yang Wang, Vivien Quéma, Allen Clement, Lorenzo Alvisi, and Mike Dahlin. 2012. All about Eve: Execute-Verify Replication for Multi-Core Servers. In 10th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2012, Hollywood, CA, USA, October 8-10, 2012. 237--250.

Digital Library

[20]

Leslie Lamport. 1998. The Part-Time Parliament. ACM Trans. Comput. Syst. 16, 2 (1998), 133--169.

Digital Library

[21]

Mojtaba Mehrara, Jeff Hao, Po-Chun Hsu, and Scott Mahlke. 2009. Parallelizing sequential applications on commodity hardware using a low-cost software transactional memory. In PLDI. 166--176.

Digital Library

[22]

Chi Cao Minh, JaeWoong Chung, Christos Kozyrakis, and Kunle Olukotun. 2008. STAMP: Stanford Transactional Applications for Multi-Processing. In IISWC. 35--46.

[23]

Cosmin E. Oancea, Alan Mycroft, and Tim Harris. 2009. A Lightweight In-place Implementation for Software Thread-level Speculation. In Proceedings of the Twenty-first Annual Symposium on Parallelism in Algorithms and Architectures (SPAA '09). ACM, New York, NY, USA, 223--232.

Digital Library

[24]

Christos H. Papadimitriou. 1979. The serializability of concurrent database updates. J. ACM 26 (October 1979), 631--653. Issue 4.

Digital Library

[25]

Manohar K. Prabhu and Kunle Olukotun. 2003. Using thread-level speculation to simplify manual parallelization. In Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming (PPoPP '03). ACM, New York, NY, USA, 1--12.

Digital Library

[26]

Hany E. Ramadan, Christopher J. Rossbach, and Emmett Witchel. 2008. Dependence-aware transactional memory for increased concurrency. In 41st Annual IEEE/ACM International Symposium on Microarchitecture (MICRO-41 2008), November 8-12, 2008, Lake Como, Italy. 246--257.

Digital Library

[27]

Hany E Ramadan, Indrajit Roy, Maurice Herlihy, and Emmett Witchel. 2009. Committing conflicting transactions in an STM. In ACM Sigplan Notices, Vol. 44. ACM, 163--172.

Digital Library

[28]

Arun Raman, Hanjun Kim, Thomas R. Mason, Thomas B. Jablin, and David I. August. 2010. Speculative parallelization using software multithreaded transactions. In Proceedings of the fifteenth edition of ASPLOS on Architectural support for programming languages and operating systems (ASPLOS '10). ACM, New York, NY, USA, 65--76.

Digital Library

[29]

Ravi Ramaseshan and Frank Mueller. 2008. Toward thread-level speculation for coarse-grained parallelism of regular access patterns. In Workshop on Programmability Issues for Multi-Core Computers. 12.

[30]

Lawrence Rauchwerger and David Padua. 1995. The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization. SIGPLAN Not. 30 (June 1995), 218--232. Issue 6.

Digital Library

[31]

Torvald Riegel, Pascal Felber, and Christof Fetzer. 2006. A Lazy Snapshot Algorithm with Eager Validation. In DISC 2006. Lecture Notes in Computer Science, Vol. 4167. Springer, 284--298.

Digital Library

[32]

Mohamed M. Saad, Masoomeh Javidi Kishi, Shihao Jing, and Roberto Palmieri. 2018. Processing Transactions in a Predefined Order. CoRR abs/1812.05727 (2018). arXiv:1812.05727 https://arxiv.org/abs/1812.05727

[33]

Mohamed M. Saad, Mohamed Mohamedin, and Binoy Ravindran. 2012. HydraVM: Extracting Parallelism from Legacy Sequential Code Using STM. In HotPar.

Digital Library

[34]

Mohamed M. Saad, Roberto Palmieri, and Binoy Ravindran. 2016. On ordering transaction commit. In Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2016, Barcelona, Spain, March 12-16, 2016, Rafael Asenjo and Tim Harris (Eds.). ACM, 46:1--46:2.

Digital Library

[35]

Mohamed M. Saad, Roberto Palmieri, and Binoy Ravindran. 2018. Lerna: Parallelizing Dependent Loops Using Speculation. In Proceedings of the 11th ACM International Systems and Storage Conference, SYSTOR 2018, HAIFA, Israel, June 04-07, 2018. ACM, 37--48.

Digital Library

[36]

Fred B. Schneider. 1990. Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv. 22, 4 (1990), 299--319.

Digital Library

[37]

Kevin Streit, Clemens Hammacher, Andreas Zeller, and Sebastian Hack. 2013. Sambamba: runtime adaptive parallel execution. In ADAPT. 7.

Digital Library

[38]

Christoph von Praun, Rajesh Bordawekar, and Calin Cascaval. 2008. Modeling optimistic concurrency using quantitative dependence analysis. In PPoPP. 185--196.

Digital Library

[39]

Christoph Von Praun, Luis Ceze, and Calin Caşcaval. 2007. Implicit parallelism with ordered transactions. In PPoPP. 79--89.

Digital Library

[40]

Lingli Zhang, Vinod K Grover, Michael M Magruder, David Detlefs, John Joseph Duffy, and Goetz Graefe. 2010. Software transaction commit order and conflict management. US Patent 7,711,678.

Cited By

Siek KWojciechowski PDhulipala LSun Y(2024)Last-Use Opacity: A Strong Safety Property for Transactional Memory with Prerelease Support (Abstract)Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing10.1145/3670684.3673411(33-35)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3670684.3673411
Miller dKorth HPalmieri RLee IChabbi MSteuwer M(2024)POSTER: OCToPus: Semantic-aware Concurrency Control for Blockchain TransactionsProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638494(463-465)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638494
Gelashvili RSpiegelman AXiang ZDanezis GLi ZMalkhi DXia YZhou RDehnavi MKulkarni MKrishnamoorthy S(2023)Block-STMProceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3572848.3577524(232-244)Online publication date: 25-Feb-2023
https://dl.acm.org/doi/10.1145/3572848.3577524
Show More Cited By

Index Terms

Processing transactions in a predefined order
1. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Concurrency control
2. Theory of computation
  1. Design and analysis of algorithms
    1. Parallel algorithms
  2. Models of computation
    1. Concurrency

Recommendations

Versioned boxes as the basis for memory transactions
Special issue: Synchronization and concurrency in object-oriented languages

In this paper, we propose the use of Versioned Boxes, which keep a history of values, as the basis for language-level memory transactions. Unlike previous work on software transactional memory, in our proposal read-only transactions never conflict with ...
Operating System Transactions
SOSP '09: Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles

Applications must be able to synchronize accesses to operating system resources in order to ensure correctness in the face of concurrency and system failures. System transactions allow the programmer to specify updates to heterogeneous system resources ...
Scalable atomic visibility with RAMP transactions
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data

Databases can provide scalability by partitioning data across several servers. However, multi-partition, multi-operation transactional access is often expensive, employing coordination-intensive locking, validation, or scheduling mechanisms. Accordingly,...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PPoPP '19: Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming

February 2019

472 pages

ISBN:9781450362252

DOI:10.1145/3293883

General Chair:
Jeff Hollingsworth
University of Maryland
,
Program Chair:
Idit Keidar
Technion, Israel

Copyright © 2019 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 February 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

PPoPP '19

Sponsor:

PPoPP '19: 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

February 16 - 20, 2019

District of Columbia, Washington

Acceptance Rates

PPoPP '19 Paper Acceptance Rate 29 of 152 submissions, 19%;

Overall Acceptance Rate 230 of 1,014 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
507
Total Downloads

Downloads (Last 12 months)105
Downloads (Last 6 weeks)49

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Siek KWojciechowski PDhulipala LSun Y(2024)Last-Use Opacity: A Strong Safety Property for Transactional Memory with Prerelease Support (Abstract)Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing10.1145/3670684.3673411(33-35)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3670684.3673411
Miller dKorth HPalmieri RLee IChabbi MSteuwer M(2024)POSTER: OCToPus: Semantic-aware Concurrency Control for Blockchain TransactionsProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638494(463-465)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638494
Gelashvili RSpiegelman AXiang ZDanezis GLi ZMalkhi DXia YZhou RDehnavi MKulkarni MKrishnamoorthy S(2023)Block-STMProceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3572848.3577524(232-244)Online publication date: 25-Feb-2023
https://dl.acm.org/doi/10.1145/3572848.3577524
Poudel PRai SGuragain SSharma G(2023)Ordered Scheduling in Control-Flow Distributed Transactional MemoryDistributed Computing and Intelligent Technology10.1007/978-3-031-24848-1_5(67-83)Online publication date: 8-Jan-2023
https://doi.org/10.1007/978-3-031-24848-1_5
Siek KWojciechowski P(2022)Last-use opacity: a strong safety property for transactional memory with prerelease supportDistributed Computing10.1007/s00446-022-00420-235:3(265-301)Online publication date: 17-Apr-2022
https://doi.org/10.1007/s00446-022-00420-2
Busch CHerlihy MPopovic MSharma G(2021)Dynamic scheduling in distributed transactional memoryDistributed Computing10.1007/s00446-021-00410-wOnline publication date: 20-Nov-2021
https://doi.org/10.1007/s00446-021-00410-w
Chen DGibbons PMowry T(2020)TardisTMProceedings of the Eleventh International Workshop on Programming Models and Applications for Multicores and Manycores10.1145/3380536.3380538(1-10)Online publication date: 22-Feb-2020
https://dl.acm.org/doi/10.1145/3380536.3380538
Saad MPalmieri RRavindran B(2019)LernaACM Transactions on Storage10.1145/331036815:1(1-24)Online publication date: 22-Mar-2019
https://dl.acm.org/doi/10.1145/3310368
Li ZRomano PVan Roy P(2019)Sparkle: Speculative Deterministic Concurrency Control for Partially Replicated Transactional Stores2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)10.1109/DSN.2019.00029(164-175)Online publication date: Jun-2019
https://doi.org/10.1109/DSN.2019.00029

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents