extended-abstract

Towards a fully-articulated pessimistic distributed transactional memory

Authors:

Paweł T. WojciechowskiAuthors Info & Claims

SPAA '13: Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures

Pages 111 - 114

https://doi.org/10.1145/2486159.2486166

Published: 23 July 2013 Publication History

Abstract

Transactional memory, an approach aiming to replace cumbersome locking mechanisms in concurrent systems, has become a popular research topic. But due to problems posed by irrevocable operations (e.g., system calls), the viability of pessimistic concurrency control for transactional memory systems is being explored, in lieu of the more typical optimistic approach. However, in a distributed setting, where partial transaction failures may happen, the inability of pessimistic transactional memories to roll back is a major shortcoming. Therefore, this paper presents a novel transactional memory concurrency control algorithm that is both fully pessimistic and rollback-capable.

References

[1]

H. Attiya and E. Hillel. Single-version STMs can be multi-version permissive. In Proc. ICDCD'11, 2011.

[2]

R. L. Bocchino, V. S. Adve, and B. L. Chamberlain. Software transactional memory for large scale clusters. In Proc. PPoPP'08, Feb. 2008.

Digital Library

[3]

V. Bushkov, R. Guerraoui, and M. Kapałka. On the liveness of transactional memory. In Proc. PODC'12, July 2012.

Digital Library

[4]

J. C. Corbett and et al. Spanner: Google's globally-distributed database. In Proc. OSDI'12, 2012.

Digital Library

[5]

M. Couceiro, P. Romano, N. Carvalho, and L. Rodrigues. D2STM: Dependable distributed software transactional memory. In Proc. PRDC'09, Nov. 2009.

Digital Library

[6]

R. Guerraoui and M. Kapałka. Principles of Transactional Memory. Morgan & Claypool, 2010.

[7]

M. Herlihy, V. Luchangco, and M. Moir. A flexible framework for implementing software transactional memory. In Proc. OOPSLA'06, Oct. 2006.

Digital Library

[8]

M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. In Proc. ISCA'93, May 1993.

Digital Library

[9]

C. Kotselidis, M. Ansari, K. Jarvis, M. Luján, C. C. Kirkham, and I. Watson. DiSTM: A software transactional memory framework for clusters. In Proc. ICPP'08, Sept. 2008.

Digital Library

[10]

A. Matveev and N. Shavit. Towards a fully pessimistic STM model. In Proc. TRANSACT'12, Aug. 2012.

[11]

D. Peng and F. Dabek. Large-scale incremental processing using distributed transactions and notifications. In Proc. OSDI'10, Oct. 2010.

Digital Library

[12]

D. Perelman, R. Fan, and I. Keidar. On maintaining multiple versions in STM. In Proc. PODC'10, 2010.

Digital Library

[13]

N. Shavit and D. Touitou. Software transactional memory. In Proc. PODC'95, Aug. 1995.

Digital Library

[14]

K. Siek and P. T. Wojciechowski. A formal design of a tool for static analysis of upper bounds on object calls in Java. In Proc. FMICS'12, LNCS 7437, Aug. 2012.

[15]

A. Turcu and B. Ravindran. On open nesting in distributed transactional memory. In Proc. SYSTOR'12, June 2012.

Digital Library

[16]

A. Welc, B. Saha, and A.-R. Adl-Tabatabai. Irrevocable transactions and their applications. In Proc. SPAA'08, June 2008.

Digital Library

[17]

P. T. Wojciechowski. Isolation-only transactions by typing and versioning. In Proc. PPDP '05, July 2005.

Digital Library

[18]

P. T. Wojciechowski. Language Design for Atomicity, Declarative Synchronization, and Dynamic Update in Communicating Systems. Poznań University of Technology Press, 2007.

[19]

P. T. Wojciechowski, T. Kobus, and M. Kokociński. Model-driven comparison of state-machine-based and deferred-update replication schemes. In Proc. SRDS'12, Oct. 2012.

Digital Library

Cited By

Cheeseman LParkinson MClebsch SKogias MDrossopoulou SChisnall DWrigstad TLiétar P(2023)When Concurrency Matters: Behaviour-Oriented ConcurrencyProceedings of the ACM on Programming Languages10.1145/36228527:OOPSLA2(1531-1560)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622852
Kobyliński PSiek KBaranowski JWojciechowski P(2017)Helenos: A realistic benchmark for distributed transactional memorySoftware: Practice and Experience10.1002/spe.254848:3(528-549)Online publication date: 9-Oct-2017
https://doi.org/10.1002/spe.2548
Siek KWojciechowski P(2016)Atomic RMIInternational Journal of Parallel Programming10.1007/s10766-015-0361-x44:3(598-619)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1007/s10766-015-0361-x
Show More Cited By

Index Terms

Towards a fully-articulated pessimistic distributed transactional memory
1. Computing methodologies
  1. Distributed computing methodologies
    1. Distributed programming languages
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Distributed programming languages

Recommendations

A new concurrency control mechanism for multi-threaded environment using transactional memory

Software transactional memory (STM) is one of the techniques used towards achieving non-blocking process synchronization in multi-threaded computing environment. In spite of its high potential, one of the major limitations of transactional memory (TM) ...
Modular transactional memory
ACSC '10: Proceedings of the Thirty-Third Australasian Conferenc on Computer Science - Volume 102

Software transactional memory has the potential to greatly simplify development of concurrent software, by supporting safe composition of concurrent shared-state abstractions. However, STM semantics are defined in terms of low-level reads and writes on ...
Safe privatization in transactional memory
PPoPP '18

Transactional memory (TM) facilitates the development of concurrent applications by letting the programmer designate certain code blocks as atomic. Programmers using a TM often would like to access the same data both inside and outside transactions, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '13: Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures

July 2013

348 pages

ISBN:9781450315722

DOI:10.1145/2486159

General Chair:
Guy Blelloch
Carnegie Mellon University, USA
,
Program Chair:
Berthold Vöcking
RWTH Aachen University, Germany

Copyright © 2013 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 the author(s) 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: 23 July 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Extended-abstract

Conference

SPAA '13

Sponsor:

SPAA '13: 25th ACM Symposium on Parallelism in Algorithms and Architectures

July 23 - 25, 2013

Québec, Montréal, Canada

Acceptance Rates

SPAA '13 Paper Acceptance Rate 31 of 130 submissions, 24%;

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

6
Total Citations
View Citations
126
Total Downloads

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

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Cheeseman LParkinson MClebsch SKogias MDrossopoulou SChisnall DWrigstad TLiétar P(2023)When Concurrency Matters: Behaviour-Oriented ConcurrencyProceedings of the ACM on Programming Languages10.1145/36228527:OOPSLA2(1531-1560)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622852
Kobyliński PSiek KBaranowski JWojciechowski P(2017)Helenos: A realistic benchmark for distributed transactional memorySoftware: Practice and Experience10.1002/spe.254848:3(528-549)Online publication date: 9-Oct-2017
https://doi.org/10.1002/spe.2548
Siek KWojciechowski P(2016)Atomic RMIInternational Journal of Parallel Programming10.1007/s10766-015-0361-x44:3(598-619)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1007/s10766-015-0361-x
Dziuma DFatourou PKanellou E(2015)Consistency for Transactional Memory ComputingTransactional Memory. Foundations, Algorithms, Tools, and Applications10.1007/978-3-319-14720-8_1(3-31)Online publication date: 2015
https://doi.org/10.1007/978-3-319-14720-8_1
Wojciechowski PSiek KShapiro M(2014)Having your cake and eating it tooProceedings of the First Workshop on Principles and Practice of Eventual Consistency10.1145/2596631.2596637(1-5)Online publication date: 13-Apr-2014
https://dl.acm.org/doi/10.1145/2596631.2596637
Zhang BRavindran BPalmieri R(2014)Distributed Transactional Contention Management as the Traveling Salesman ProblemStructural Information and Communication Complexity10.1007/978-3-319-09620-9_6(54-67)Online publication date: 2014
https://doi.org/10.1007/978-3-319-09620-9_6

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