research-article

On avoiding spare aborts in transactional memory

Authors:

Dmitri PerelmanAuthors Info & Claims

SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures

Pages 59 - 68

https://doi.org/10.1145/1583991.1584013

Published: 11 August 2009 Publication History

Abstract

This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, commit without violating correctness. We call such unnecessary aborts spare aborts. We classify what kinds of spare aborts can be eliminated, and which cannot. We further study what kinds of spare aborts can be avoided efficiently. Specifically, we show that some unnecessary aborts cannot be avoided, and that there is an inherent tradeoff between the overhead of a TM and the extent to which it reduces the number of spare aborts. We also present an efficient example TM algorithm that avoids certain kinds of spare aborts, and analyze its properties and performance.

References

[1]

H. Attiya, L. Epstein, H. Shachnai, and T. Tamir. Transactional contention management as a non-clairvoyant scheduling problem. In ACM PODC, 2006.

Digital Library

[2]

U. Aydonat and T. Abdelrahman. Serializability of transactions in software transactional memory. In Second ACM SIGPLAN Workshop on Transactional Computing, 2008.

[3]

D. Dice, O. Shalev, and N. Shavit. Transactional locking 2. In DISC, 2006.

Digital Library

[4]

R. Ennals. Cache sensitive software transactional memory. Technical report, Intel.

[5]

K. Fraser. Practical lock-freedom. Technical report, Cambridge, 2004.

[6]

V. Gramoli, D. Harmanci, and P. Felber. Toward a theory of input acceptance for transactional memories. In OPODIS, 2008.

Digital Library

[7]

R. Guerraoui, T. A. Henzinger, and V. Singh. In DISC, 2008.

[8]

R. Guerraoui and M. Kapalka. On the correctness of transactional memory. In ACM SIGPLAN PPoPP, 2008.

Digital Library

[9]

M. Herlihy, V. Luchangco, M. Moir, and W. N. Scherer, III. Software transactional memory for dynamic-sized data structures. In ACM PODC, 2003.

Digital Library

[10]

M. Herlihy and J. E. B. Moss. Transactional memory: architectural support for lock-free data structures. SIGARCH Comput. Archit. News, 1993.

Digital Library

[11]

I. Keidar and D. Perelman. On avoiding spare aborts in Transactional Memory. Technical Report CCIT Report #733, Technion, 2009.

Digital Library

[12]

J. E. B. Moss. Open nested transactions: Semantics and support. In Workshop on Memory Performance Issues (WMPI'06), 2006.

[13]

J. Napper and L. Alvisi. Lock-free serializable transactions. Technical report, The University of Texas at Austin, 2005.

[14]

C. H. Papadimitriou. The serializability of concurrent database updates. J. ACM, 1979.

Digital Library

[15]

T. Riegel, C. Fetzer, H. Sturzrehm, and P. Felber. From causal to z-linearizable transactional memory. Technical report, Universit&#233; de Neuch&#226;tel, 2007.

[16]

N. Shavit and D. Touitou. Software transactional memory. In ACM PODC, 1995.

Digital Library

[17]

G. Weikum and G. Vossen. Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery. 2002.

Digital Library

Cited By

Sutra PMarlier PSchiavoni VTrahay F(2018)Boosting Transactional Memory with Stricter SerializabilityCoordination Models and Languages10.1007/978-3-319-92408-3_11(231-251)Online publication date: 27-May-2018
https://doi.org/10.1007/978-3-319-92408-3_11
Dongol BJagadeesan RRiely J(2017)Transactions in relaxed memory architecturesProceedings of the ACM on Programming Languages10.1145/31581062:POPL(1-29)Online publication date: 27-Dec-2017
https://dl.acm.org/doi/10.1145/3158106
Fatourou P(2017)Concurrency for the Masses: The Paradigm of Software Transactional Memory2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)10.1109/SYNASC.2017.00012(17-22)Online publication date: Sep-2017
https://doi.org/10.1109/SYNASC.2017.00012
Show More Cited By

Index Terms

On avoiding spare aborts in transactional memory
1. Computing methodologies
  1. Concurrent computing methodologies
    1. Concurrent programming languages
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Concurrent programming languages

Recommendations

On Avoiding Spare Aborts in Transactional Memory

This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, commit without violating correctness. We call such unnecessary aborts spare ...
Transactional Read-Modify-Write Without Aborts

Language-level transactions are said to provide “atomicity,” implying that the order of operations within a transaction should be invisible to concurrent transactions and thus that independent operations within a transaction should be safe to execute in ...
Unbounded page-based transactional memory
Proceedings of the 2006 ASPLOS Conference

Exploiting thread level parallelism is paramount in the multicore era. Transactions enable programmers to expose such parallelism by greatly simplifying the multi-threaded programming model. Virtualized transactions (unbounded in space and time) are ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures

August 2009

370 pages

ISBN:9781605586069

DOI:10.1145/1583991

General Chair:
Friedhelm Meyer auf der Heide
University of Paderborn, Germany)
,
Program Chair:
Michael A. Bender
Stony Brook University and Tokutek, Inc., USA

Copyright © 2009 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: 11 August 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tag

transactional memory

Qualifiers

Research-article

Conference

SPAA 09

Sponsor:

SPAA 09: 21st ACM Symposium on Parallelism in Algorithms and Architectures

August 11 - 13, 2009

AB, Calgary, Canada

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

37
Total Citations
View Citations
223
Total Downloads

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

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Sutra PMarlier PSchiavoni VTrahay F(2018)Boosting Transactional Memory with Stricter SerializabilityCoordination Models and Languages10.1007/978-3-319-92408-3_11(231-251)Online publication date: 27-May-2018
https://doi.org/10.1007/978-3-319-92408-3_11
Dongol BJagadeesan RRiely J(2017)Transactions in relaxed memory architecturesProceedings of the ACM on Programming Languages10.1145/31581062:POPL(1-29)Online publication date: 27-Dec-2017
https://dl.acm.org/doi/10.1145/3158106
Fatourou P(2017)Concurrency for the Masses: The Paradigm of Software Transactional Memory2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)10.1109/SYNASC.2017.00012(17-22)Online publication date: Sep-2017
https://doi.org/10.1109/SYNASC.2017.00012
(2017)Partial Rollback-based Scheduling on In-memory Transactional Data GridsBig Data Research10.1016/j.bdr.2017.06.0049:C(47-56)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1016/j.bdr.2017.06.004
Shay RKomanduri SDurity AHuh PMazurek MSegreti SUr BBauer LChristin NCranor L(2016)Designing Password Policies for Strength and UsabilityACM Transactions on Information and System Security10.1145/289141118:4(1-34)Online publication date: 6-May-2016
https://dl.acm.org/doi/10.1145/2891411
Fatourou PKanellou EKosmas ERabbi M(2016)WFR-TMJournal of Parallel and Distributed Computing10.1016/j.jpdc.2016.05.00296:C(134-151)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1016/j.jpdc.2016.05.002
Hans SHassan APalmieri RPeluso SRavindran B(2016)Opacity vs TMS2: Expectations and RealityDistributed Computing10.1007/978-3-662-53426-7_20(269-283)Online publication date: 4-Sep-2016
https://doi.org/10.1007/978-3-662-53426-7_20
Diegues NRomano P(2015)Time-WarpACM Transactions on Parallel Computing10.1145/27754352:2(1-44)Online publication date: 29-Jun-2015
https://dl.acm.org/doi/10.1145/2775435
Zhang BRavindran BPalmieri RDas SKrishnaswamy DKarkar SKorman AKumar MPortmann MSastry S(2015)Reducing Aborts in Distributed Transactional Systems through Dependency DetectionProceedings of the 16th International Conference on Distributed Computing and Networking10.1145/2684464.2684475(1-10)Online publication date: 4-Jan-2015
https://dl.acm.org/doi/10.1145/2684464.2684475
Keidar IPerelman D(2015)Multi-versioning in Transactional MemoryTransactional Memory. Foundations, Algorithms, Tools, and Applications10.1007/978-3-319-14720-8_7(150-165)Online publication date: 2015
https://doi.org/10.1007/978-3-319-14720-8_7
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten