Article

A lazy snapshot algorithm with eager validation

Authors:

Torvald Riegel,

Christof FetzerAuthors Info & Claims

DISC'06: Proceedings of the 20th international conference on Distributed Computing

Pages 284 - 298

https://doi.org/10.1007/11864219_20

Published: 18 September 2006 Publication History

Abstract

Most high-performance software transactional memories (STM) use optimistic invisible reads. Consequently, a transaction might have an inconsistent view of the objects it accesses unless the consistency of the view is validated whenever the view changes. Although all STMs usually detect inconsistencies at commit time, a transaction might never reach this point because an inconsistent view can provoke arbitrary behavior in the application (e.g., enter an infinite loop). In this paper, we formally introduce a lazy snapshot algorithm that verifies at each object access that the view observed by a transaction is consistent. Validating previously accessed objects is not necessary for that, however, it can be used on-demand to prolong the view's validity. We demonstrate both formally and by measurements that the performance of our approach is quite competitive by comparing other STMs with an STM that uses our algorithm.

References

[1]

Shavit, N., Touitou, D.: Software transactional memory. In: Proceedings of PODC. (1995).

Digital Library

[2]

Saha, B., Adl-Tabatabai, A.R., Hudson, R.L., Minh, C.C., Hertzberg, B.: McRTSTM: a high performance software transactional memory system for a multicore runtime. In: PPoPP '06: Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming. (2006).

Digital Library

[3]

Harris, T., Plesko, M., Shinnar, A., Tarditi, D.: Optimizing Memory Transactions. In: PLDI '06: ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation. (2006).

Digital Library

[4]

Dice, D., Shavit, N.: What really makes transactions fast? In: TRANSACT. (2006).

[5]

Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3) (1990) 463-492.

Digital Library

[6]

Riegel, T., Fetzer, C., Felber, P.: Snapshot isolation for software transactional memory. In: TRANSACT06. (2006).

[7]

Berenson, H., Bernstein, P., Gray, J., Melton, J., O'Neil, E., O'Neil, P.: A critique of ANSI SQL isolation levels. In: Proceedings of SIGMOD. (1995) 1-10.

Digital Library

[8]

Harris, T., Fraser, K.: Language support for lightweight transactions. In: Proceedings of OOPSLA. (2003) 388-402.

Digital Library

[9]

Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.: Software transactional memory for dynamic-sized data structures. In: Proceedings of PODC. (2003).

Digital Library

[10]

Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems. (2003).

Digital Library

[11]

Scherer III, W.N., Scott, M.L.: Contention management in dynamic software transactional memory. In: Proceedings of the PODC Workshop on Concurrency and Synchronization in Java Programs. (2004).

[12]

Scherer III, W., Scott, M.: Advanced contention management for dynamic software transactional memory. In: Proceedings of PODC. (2005).

Digital Library

[13]

Marathe, V.J., III, W.N.S., Scott, M.L.: Adaptive software transactional memory. In: Proceedings of DISC. (2005) 354-368.

Digital Library

[14]

Cole, C., Herlihy, M.: Snapshots and software transactional memory. Science of Computer Programming (2005).

Digital Library

[15]

Dice, D., Shalev, O., Shavit, N.: Transactional Locking II. In: 20th International Symposium on Distributed Computing (DISC). (2006).

Digital Library

[16]

Cachopo, J., Rito-Silva, A.: Versioned boxes as the basis for memory transactions. In: Proceedings of SCOOL. (2005).

[17]

Guerraoui, R., Herlihy, M., Pochon, B.: Polymorphic contention management. In: Proceedings of DISC. (2005)

Digital Library

Cited By

Blelloch GWei YLee IChabbi MSteuwer M(2024)VERLIB: Concurrent Versioned PointersProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638501(200-214)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638501
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
Cardoso DFoss LDu Bois A(2021)A Graph Transformation System formalism for correctness of Transactional Memory algorithmsProceedings of the 25th Brazilian Symposium on Programming Languages10.1145/3475061.3475080(49-57)Online publication date: 27-Sep-2021
https://dl.acm.org/doi/10.1145/3475061.3475080
Show More Cited By

Index Terms

A lazy snapshot algorithm with eager validation
1. Networks
  1. Network performance evaluation

Index terms have been assigned to the content through auto-classification.

Recommendations

Lazy database replication with snapshot isolation
VLDB '06: Proceedings of the 32nd international conference on Very large data bases

Snapshot isolation is a popular transactional isolation level in database systems. Several replication techniques based on snapshot isolation have recently been proposed. These proposals, however, do not fully leverage the local concurrency controls ...
An optimal multi-writer snapshot algorithm
STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

An m-component, n-process snapshot object is an abstraction of shared memory that consists of m words and allows up to n processes to concurrently execute the following two types of operations: write(i,v), which writes v into the ith word, and scan(), ...
A critique of snapshot isolation
EuroSys '12: Proceedings of the 7th ACM european conference on Computer Systems

The support for transactions is an essential part of a database management system (DBMS). Without this support, the developers are burdened with ensuring atomic execution of a transaction despite failures as well as concurrent accesses to the database ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

DISC'06: Proceedings of the 20th international conference on Distributed Computing

September 2006

585 pages

ISBN:3540446249

Editor:
Shlomi Dolev
Department of Computer Science, Ben Gurion University of the Negev, Israel

Sponsors

BGU: BGU
Swedish Institute of Computer Science: Swedish Institute of Computer Science
Sun Microsystems
Intel: Intel
Microsoft Research: Microsoft Research

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 18 September 2006

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

92
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 04 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Blelloch GWei YLee IChabbi MSteuwer M(2024)VERLIB: Concurrent Versioned PointersProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638501(200-214)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638501
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
Cardoso DFoss LDu Bois A(2021)A Graph Transformation System formalism for correctness of Transactional Memory algorithmsProceedings of the 25th Brazilian Symposium on Programming Languages10.1145/3475061.3475080(49-57)Online publication date: 27-Sep-2021
https://dl.acm.org/doi/10.1145/3475061.3475080
Wen HCai WDu MJenkins LValpey BScott M(2021)A Fast, General System for Buffered Persistent Data StructuresProceedings of the 50th International Conference on Parallel Processing10.1145/3472456.3472458(1-11)Online publication date: 9-Aug-2021
https://dl.acm.org/doi/10.1145/3472456.3472458
Bashari BWoelfel PMiller ACensor-Hillel K(2021)An Efficient Adaptive Partial Snapshot ImplementationProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467939(545-555)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467939
Wei YBen-David NBlelloch GFatourou PRuppert ESun YLee JPetrank E(2021)Constant-time snapshots with applications to concurrent data structuresProceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3437801.3441602(31-46)Online publication date: 17-Feb-2021
https://dl.acm.org/doi/10.1145/3437801.3441602
Shamis ARenzelmann MNovakovic SChatzopoulos GDragojević ANarayanan DCastro MBoncz PManegold SAilamaki ADeshpande AKraska T(2019)Fast General Distributed Transactions with OpacityProceedings of the 2019 International Conference on Management of Data10.1145/3299869.3300069(433-448)Online publication date: 25-Jun-2019
https://dl.acm.org/doi/10.1145/3299869.3300069
Saad MKishi MJing SHans SPalmieri RHollingsworth JKeidar I(2019)Processing transactions in a predefined orderProceedings of the 24th Symposium on Principles and Practice of Parallel Programming10.1145/3293883.3295730(120-132)Online publication date: 16-Feb-2019
https://dl.acm.org/doi/10.1145/3293883.3295730
de Carvalho JAraujo GBaldassin A(2019)The Case for Phase-Based Transactional MemoryIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2018.286171230:2(459-472)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1109/TPDS.2018.2861712
Chaudhary VJuyal CKulkarni SKumari SPeri S(2019)Achieving Starvation-Freedom in Multi-version Transactional Memory SystemsNetworked Systems10.1007/978-3-030-31277-0_20(291-310)Online publication date: 19-Jun-2019
https://dl.acm.org/doi/10.1007/978-3-030-31277-0_20
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents