poster

Optimistic transactional boosting

Authors:

Ahmed Hassan,

Roberto Palmieri,

Binoy RavindranAuthors Info & Claims

ACM SIGPLAN Notices, Volume 49, Issue 8

Pages 387 - 388

https://doi.org/10.1145/2692916.2555283

Published: 06 February 2014 Publication History

Get Access

Abstract

Herlihy and Koskinen's transactional boosting methodology addressed the challenge of converting concurrent data structures into transactional ones. We present an optimistic methodology for boosting concurrent collections. Optimistic boosting allows greater data structure-specific optimizations, easier integration with STM frameworks, and lower restrictions on the boosted operations than the original boosting methodology.

References

[1]

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

Digital Library

Google Scholar

[2]

M. Herlihy and E. Koskinen. Transactional boosting: a methodology for highly-concurrent transactional objects. In PPoPP, 2008.

Digital Library

Google Scholar

[3]

M. Herlihy and N. Shavit. The Art of Multiprocessor Programming, Revised Reprint. Elsevier, 2012.

Digital Library

Google Scholar

[4]

N. Shavit and D. Touitou. Software transactional memory. Distributed Computing, 10 (2), 1997.

Google Scholar

Cited By

View all

Anjana PAttiya HKumari SPeri SSomani A(2020)Efficient Concurrent Execution of Smart Contracts in Blockchains Using Object-Based Transactional MemoryNetworked Systems10.1007/978-3-030-67087-0_6(77-93)Online publication date: 3-Jun-2020
https://dl.acm.org/doi/10.1007/978-3-030-67087-0_6
Dickerson TKoskinen EGazzillo PHerlihy M(2019)Conflict Abstractions and Shadow Speculation for Optimistic Transactional ObjectsProgramming Languages and Systems10.1007/978-3-030-34175-6_16(313-331)Online publication date: 18-Nov-2019
https://doi.org/10.1007/978-3-030-34175-6_16
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: 18-Jun-2018
https://dl.acm.org/doi/10.1007/978-3-319-92408-3_11
Show More Cited By

Recommendations

Optimistic transactional boosting
PPoPP '14: Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming

Herlihy and Koskinen's transactional boosting methodology addressed the challenge of converting concurrent data structures into transactional ones. We present an optimistic methodology for boosting concurrent collections. Optimistic boosting allows ...
Transactional boosting: a methodology for highly-concurrent transactional objects
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming

We describe a methodology for transforming a large class of highly-concurrent linearizable objects into highly-concurrent transactional objects. As long as the linearizable implementation satisfies certain regularity properties (informally, that every ...
Lock-Free Transactional Transformation for Linked Data Structures
Special Issue on SPAA 2016

Nonblocking data structures allow scalable and thread-safe access to shared data. They provide individual operations that appear to execute atomically. However, it is often desirable to execute multiple operations atomically in a transactional manner. ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 49, Issue 8

PPoPP '14

August 2014

390 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/2692916

Editors:
Mark W. Bailey
Hamilton College, Clinton, NY
,
Rajeev Balasubramonian
University of Utah
,
Al Davis
University of Utah
,
Sarita Adve
University of Illinois at Urbana-Champ

Issue’s Table of Contents

PPoPP '14: Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
February 2014
412 pages
ISBN:9781450326568
DOI:10.1145/2555243
General Chair:
José Moreira
IBM Research, USA
,
Program Chair:
James Larus
EPFL, Switzerland

Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 February 2014

Published in SIGPLAN Volume 49, Issue 8

Check for updates

Author Tags

Qualifiers

Poster

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
257
Total Downloads

Downloads (Last 12 months)14
Downloads (Last 6 weeks)3

Reflects downloads up to 20 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Anjana PAttiya HKumari SPeri SSomani A(2020)Efficient Concurrent Execution of Smart Contracts in Blockchains Using Object-Based Transactional MemoryNetworked Systems10.1007/978-3-030-67087-0_6(77-93)Online publication date: 3-Jun-2020
https://dl.acm.org/doi/10.1007/978-3-030-67087-0_6
Dickerson TKoskinen EGazzillo PHerlihy M(2019)Conflict Abstractions and Shadow Speculation for Optimistic Transactional ObjectsProgramming Languages and Systems10.1007/978-3-030-34175-6_16(313-331)Online publication date: 18-Nov-2019
https://doi.org/10.1007/978-3-030-34175-6_16
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: 18-Jun-2018
https://dl.acm.org/doi/10.1007/978-3-319-92408-3_11
Juyal CKulkarni SKumari SPeri SSomani A(2018)An Innovative Approach to Achieve Compositionality Efficiently Using Multi-version Object Based Transactional SystemsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-03232-6_19(284-300)Online publication date: 20-Oct-2018
https://doi.org/10.1007/978-3-030-03232-6_19
Hassan APalmieri RRavindran B(2015)Transactional Interference-Less Balanced TreeProceedings of the 29th International Symposium on Distributed Computing - Volume 936310.1007/978-3-662-48653-5_22(325-340)Online publication date: 7-Oct-2015
https://dl.acm.org/doi/10.1007/978-3-662-48653-5_22
Akkoorath DBieniusa A(2015)Transactions on Mergeable ObjectsProgramming Languages and Systems10.1007/978-3-319-26529-2_23(427-444)Online publication date: 9-Dec-2015
https://doi.org/10.1007/978-3-319-26529-2_23
Gramoli VGuerraoui R(2014)Reusable Concurrent Data TypesProceedings of the 28th European Conference on ECOOP 2014 --- Object-Oriented Programming - Volume 858610.1007/978-3-662-44202-9_8(182-206)Online publication date: 1-Aug-2014
https://dl.acm.org/doi/10.1007/978-3-662-44202-9_8
Hassan APalmieri RRavindran B(2014)On Developing Optimistic Transactional Lazy SetPrinciples of Distributed Systems10.1007/978-3-319-14472-6_29(437-452)Online publication date: 2014
https://doi.org/10.1007/978-3-319-14472-6_29
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
Sheng YHassan ASpear M(2023)Separating Mechanism from Policy in STM2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT)10.1109/PACT58117.2023.00031(279-296)Online publication date: 21-Oct-2023
https://doi.org/10.1109/PACT58117.2023.00031
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.

Cited By

Index Terms

Recommendations

Optimistic transactional boosting

Transactional boosting: a methodology for highly-concurrent transactional objects

Lock-Free Transactional Transformation for Linked Data Structures