research-article

Public Access

On ordering transaction commit

Authors:

Mohamed M. Saad,

Roberto Palmieri,

Binoy RavindranAuthors Info & Claims

ACM SIGPLAN Notices, Volume 51, Issue 8

Article No.: 46, Pages 1 - 2

https://doi.org/10.1145/3016078.2851191

Published: 27 February 2016 Publication History

PDF eReader

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 Scholar

[2]

L. Dalessandro, M. F. Spear, and M. L. Scott. Norec: Streamlining stm by abolishing ownership records. In PPoPP, pages 67--78, 2010.

Digital Library

Google Scholar

[3]

D. Dice, O. Shalev, and N. Shavit. Transactional Locking II. In DISC, pages 194--208, 2006.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[5]

M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. In ISCA, pages 289--300, 1993.

Digital Library

Google Scholar

[6]

L. Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16 (2):133--169, 1998.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[9]

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

Digital Library

Google Scholar

[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 Scholar

Index Terms

On ordering transaction commit

Recommendations

On ordering transaction commit
PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

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 ...
Enforcing isolation and ordering in STM
Proceedings of the 2007 PLDI conference

Transactional memory provides a new concurrency control mechanism that avoids many of the pitfalls of lock-based synchronization. High-performance software transactional memory (STM) implementations thus far provide weak atomicity: Accessing shared data ...
Commit phase in timestamp-based stm
SPAA '08: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures

Timestamp-based Software Transactional Memory (STM)validation techniques use a global shared counter and timestamping of objects being written to reason about sequencing of transactions and their linearization points, while reducing the number of ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 51, Issue 8

PPoPP '16

August 2016

405 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/3016078

Editor:
Matthew Fluet

Issue’s Table of Contents

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
General Chair:
Rafael Asenjo
University of Málaga, Spain
,
Program Chair:
Tim Harris
Oracle Labs, Cambridge, UK

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 February 2016

Published in SIGPLAN Volume 51, Issue 8

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Air Force Office of Scientific Research

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
370
Total Downloads

Downloads (Last 12 months)63
Downloads (Last 6 weeks)18

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Abstract

References

Index Terms

Recommendations