short-paper

Brief announcement: actions in the twilight - concurrent irrevocable transactions and inconsistency repair

Authors:

Annette Bieniusa,

Arie Middelkoop,

Peter ThiemannAuthors Info & Claims

PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Pages 71 - 72

https://doi.org/10.1145/1835698.1835714

Published: 25 July 2010 Publication History

Get Access

Abstract

Twilight STM enhances a transaction with twilight code that executes between the preparation to commit the transaction and its actual commit or abort. Twilight code runs irrevocably and concurrently with the rest of the program. It can detect and repair potential read inconsistencies in the state of its transaction and may thus turn a failing transaction into a successful one. Moreover, twilight code can safely use I/O operations while modifying the transactionally managed memory.

The Twilight STM keeps a pending transaction committable while running the twilight code, but without blocking all other transactions, including pending transactions that execute their twilight code at the same time. Benchmark results show that Twilight performs competitively with state-of-the-art systems like TL2.

References

[1]

A. Bieniusa, A. Middelkoop, and P. Thiemann. Actions in the Twilight: Concurrent irrevocable transactions and inconsistency repair (extended version). Technical Report 257, Institut für Informatik, Universität Freiburg, 2010.

Google Scholar

[2]

C. Cao Minh et al., Stamp: Stanford transactional applications for multi-processing. In IISWC '08: Proc. IEEE International Symposium on Workload Characterization, pages 35--46, September 2008.

Google Scholar

[3]

D. Dice, O. Shalev, and N. Shavit. Transactional locking II. In Proceedings of the 20th International Symposium on Distributed Computing, DISC 2006, LNCS 4167, pages 194--208. Springer, 2006.

Digital Library

Google Scholar

[4]

M. F. Spear, M. M. Michael, and M. L. Scott. Inevitability mechanisms for software transactional memory. In TRANSACT '08, 2008.

Google Scholar

[5]

A. Welc, A. L. Hosking, and S. Jagannathan. Transparently reconciling transactions with locking for Java synchronization. In 20th ECOOP, volume 4067 of LNCS, pages 148--173, Nantes, France, July 2006. Springer.

Digital Library

Google Scholar

[6]

A. Welc, B. Saha, and A.-R. Adl-Tabatabai. Irrevocable transactions and their applications. In SPAA '08: Proc. Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, pages 285--296, New York, NY, USA, 2008. ACM.

Digital Library

Google Scholar

Cited By

View all

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
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
Bieniusa AThiemann P(2011)Proving isolation properties for software transactional memoryProceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software10.5555/1987211.1987214(38-56)Online publication date: 26-Mar-2011
https://dl.acm.org/doi/10.5555/1987211.1987214
Show More Cited By

Index Terms

Brief announcement: actions in the twilight - concurrent irrevocable transactions and inconsistency repair
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

Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed Computing

Most STM systems are poorly equipped to support libraries of concurrent data structures. One reason is that they typically detect conflicts by tracking transactions' read sets and write sets, an approach that often leads to false conflicts. A second is ...
Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible
SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures

This brief announcement studies the relation between two STM properties (read invisibility and permissiveness) and two consistency conditions for STM systems, namely, opacity and virtual world consistency. A read operation issued by a transaction is ...
Brief announcement: single-version permissive STM
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

We present a single-version STM that satisfies a practical notion of permissiveness: it never aborts read-only transactions, and it only aborts an update transaction due to another conflicting update transaction, thereby avoiding many spurious aborts. ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

July 2010

494 pages

ISBN:9781605588889

DOI:10.1145/1835698

General Chairs:
Andrea Richa
Arizona State University, USA
,
Rachid Guerraoui
EPFL, Switzerland

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

PODC '10

Sponsor:

PODC '10: ACM Symposium on Principles of Distributed Computing

July 25 - 28, 2010

Zurich, Switzerland

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
113
Total Downloads

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

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

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
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
Bieniusa AThiemann P(2011)Proving isolation properties for software transactional memoryProceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software10.5555/1987211.1987214(38-56)Online publication date: 26-Mar-2011
https://dl.acm.org/doi/10.5555/1987211.1987214
Ravi SGramoli VLuchangco V(2010)Transactional memory, linking theory and practiceACM SIGACT News10.1145/1907450.190754641:4(109-115)Online publication date: 16-Dec-2010
https://dl.acm.org/doi/10.1145/1907450.1907546

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.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures

Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible

Brief announcement: single-version permissive STM

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations