research-article

All in One: Design, Verification, and Implementation of SNOW-optimal Read Atomic Transactions

Author:

Si LiuAuthors Info & Claims

ACM Transactions on Software Engineering and Methodology (TOSEM), Volume 31, Issue 3

Article No.: 43, Pages 1 - 44

https://doi.org/10.1145/3494517

Published: 07 March 2022 Publication History

Abstract

Distributed read atomic transactions are important building blocks of modern cloud databases that magnificently bridge the gap between data availability and strong data consistency. The performance of their transactional reads is particularly critical to the overall system performance, as many real-world database workloads are dominated by reads. Following the SNOW design principle for optimal reads, we develop LORA, a novel SNOW-optimal algorithm for distributed read atomic transactions. LORA completes its reads in exactly one round trip, even in the presence of conflicting writes, without imposing additional overhead to the communication, and it outperforms the state-of-the-art read atomic algorithms.

To guide LORA’s development, we present a rewriting-logic-based framework and toolkit for design, verification, implementation, and evaluation of distributed databases. Within the framework, we formalize LORA and mathematically prove its data consistency guarantees. We also apply automatic model checking and statistical verification to validate our proofs and to estimate LORA’s performance. We additionally generate from the formal model a correct-by-construction distributed implementation for testing and performance evaluation under realistic deployments. Our design-level and implementation-based experimental results are consistent, which together demonstrate LORA’s promising data consistency and performance achievement.

References

[1]

Gul A. Agha, José Meseguer, and Koushik Sen. 2006. PMaude: Rewrite-based specification language for probabilistic object systems. Electron. Notes Theor. Comput. Sci. 153, 2 (2006).

Digital Library

[2]

Marcos K. Aguilera, Joshua B. Leners, and Michael Walfish. 2015. Yesquel: Scalable SQL storage for web applications. In SOSP. ACM, 245–262.

[3]

Marcos Kawazoe Aguilera, Arif Merchant, Mehul A. Shah, Alistair C. Veitch, and Christos T. Karamanolis. 2009. Sinfonia: A new paradigm for building scalable distributed systems. ACM Trans. Comput. Syst. 27, 3 (2009), 5:1–5:48.

Digital Library

[4]

Deepthi Devaki Akkoorath, Alejandro Z. Tomsic, Manuel Bravo, Zhongmiao Li, Tyler Crain, Annette Bieniusa, Nuno M. Preguiça, and Marc Shapiro. 2016. Cure: Strong semantics meets high availability and low latency. In ICDCS’16. IEEE Computer Society, 405–414.

[5]

Musab AlTurki and José Meseguer. 2011. PVeStA: A parallel statistical model checking and quantitative analysis tool. In CALCO’11 (LNCS), Vol. 6859. Springer, 386–392.

[6]

Rajeev Alur, Thomas A. Henzinger, and Moshe Y. Vardi. 2015. Theory in practice for system design and verification. ACM SIGLOG News 2, 1 (2015), 46–51.

Digital Library

[7]

Eric Anderson, Xiaozhou Li, Mehul A. Shah, Joseph Tucek, and Jay J. Wylie. 2010. What consistency does your key-value store actually provide? In HotDep. USENIX Association.

[8]

Masoud Saeida Ardekani, Pierre Sutra, and Marc Shapiro. 2013. Non-monotonic snapshot isolation: Scalable and strong consistency for geo-replicated transactional systems. In SRDS. 163–172.

[9]

Peter Bailis, Aaron Davidson, Alan Fekete, Ali Ghodsi, Joseph M. Hellerstein, and Ion Stoica. 2013. Highly available transactions: Virtues and limitations. PVLDB 7, 3 (2013).

[10]

Peter Bailis, Alan Fekete, Ali Ghodsi, Joseph M. Hellerstein, and Ion Stoica. 2016. Scalable atomic visibility with RAMP transactions. ACM Trans. Datab. Syst. 41, 3 (2016), 15:1–15:45.

[11]

Theophilus Benson, Aditya Akella, and David A. Maltz. 2010. Network traffic characteristics of data centers in the wild. In IMC. ACM, 267–280.

[12]

Hal Berenson, Philip A. Bernstein, Jim Gray, Jim Melton, Elizabeth J. O’Neil, and Patrick E. O’Neil. 1995. A critique of ANSI SQL isolation levels. In SIGMOD. ACM, 1–10.

[13]

Philip A. Bernstein, Vassos Hadzilacos, and Nathan Goodman. 1987. Concurrency Control and Recovery in Database Systems. Addison Wesley.

Digital Library

[14]

Yves Bertot and Pierre Castéran. 2004. Interactive Theorem Proving and Program Development - Coq’Art: The Calculus of Inductive Constructions. Springer.

[15]

Ranadeep Biswas and Constantin Enea. 2019. On the complexity of checking transactional consistency. Proc. ACM Program. Lang. 3, OOPSLA (2019), 165:1–165:28.

Digital Library

[16]

Rakesh Bobba, Jon Grov, Indranil Gupta, Si Liu, José Meseguer, Peter Csaba Ölveczky, and Stephen Skeirik. 2018. Survivability: Design, formal modeling, and validation of cloud storage systems using Maude. In Assured Cloud Computing. Wiley-IEEE Computer Society Press, 10–48.

[17]

Eric A. Brewer. 2000. Towards robust distributed systems (abstract). In PODC.

[18]

Nathan Bronson, Zach Amsden, George Cabrera, Prasad Chakka, Peter Dimov, Hui Ding, Jack Ferris, Anthony Giardullo, Sachin Kulkarni, Harry C. Li, Mark Marchukov, Dmitri Petrov, Lovro Puzar, Yee Jiun Song, and Venkateshwaran Venkataramani. 2013. TAO: Facebook’s distributed data store for the social graph. In USENIX ATC’13. USENIX Association, 49–60.

[19]

Cassandra. 2021. Retrieved from http://cassandra.apache.org.

[20]

Andrea Cerone, Giovanni Bernardi, and Alexey Gotsman. 2015. A framework for transactional consistency models with atomic visibility. In CONCUR. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

[21]

Audrey Cheng, Xiao Shi, Lu Pan, Anthony Simpson, Neil Wheaton, Shilpa Lawande, Nathan Bronson, Peter Bailis, Natacha Crooks, and Ion Stoica. 2021. RAMP-TAO: Layering atomic transactions on Facebook’s online TAO data store. Proc. VLDB Endow. 14, 12 (2021), 3014–327. http://www.vldb.org/pvldb/vol14/p3014-cheng.pdf.

[22]

Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, and Carolyn L. Talcott. 2007. All About Maude. LNCS, Vol. 4350. Springer.

[23]

Brian F. Cooper, Adam Silberstein, Erwin Tam, Raghu Ramakrishnan, and Russell Sears. 2010. Benchmarking cloud serving systems with YCSB. In SOCC’10. ACM, 143–154.

Digital Library

[24]

James C. Corbett, Jeffrey Dean, Michael Epstein, Andrew Fikes, Christopher Frost, J. J. Furman, Sanjay Ghemawat, Andrey Gubarev, Christopher Heiser, Peter Hochschild, Wilson C. Hsieh, Sebastian Kanthak, Eugene Kogan, Hongyi Li, Alexander Lloyd, Sergey Melnik, David Mwaura, David Nagle, Sean Quinlan, Rajesh Rao, Lindsay Rolig, Yasushi Saito, Michal Szymaniak, Christopher Taylor, Ruth Wang, and Dale Woodford. 2012. Spanner: Google’s globally-distributed database. In 10th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2012, Hollywood, CA, USA, October 8-10, 2012, Chandu Thekkath and Amin Vahdat (Eds.). 251–264. https://www.usenix.org/conference/osdi12/technical-sessions/presentation/corbett.

[25]

James A. Cowling and Barbara Liskov. 2012. Granola: Low-overhead distributed transaction coordination. In USENIX ATC. USENIX Association, 223–235.

[26]

Ankush Desai, Vivek Gupta, Ethan K. Jackson, Shaz Qadeer, Sriram K. Rajamani, and Damien Zufferey. 2013. P: Safe asynchronous event-driven programming. In PLDI. ACM, 321–332.

[27]

Ankush Desai, Amar Phanishayee, Shaz Qadeer, and Sanjit A. Seshia. 2018. Compositional programming and testing of dynamic distributed systems. Proc. ACM Program. Lang. 2, OOPSLA (2018), 159:1–159:30.

Digital Library

[28]

Akon Dey, Alan Fekete, Raghunath Nambiar, and Uwe Röhm. 2014. YCSB+T: Benchmarking web-scale transactional databases. In ICDE. IEEE Computer Society, 223–230.

[29]

Diego Didona, Rachid Guerraoui, Jingjing Wang, and Willy Zwaenepoel. 2018. Causal consistency and latency optimality: Friend or foe?Proc. VLDB Endow. 11, 11 (2018), 1618–1632.

Digital Library

[30]

Cezara Dragoi, Thomas A. Henzinger, and Damien Zufferey. 2016. PSync: A partially synchronous language for fault-tolerant distributed algorithms. In POPL. ACM, 400–415.

[31]

Jonas Eckhardt, Tobias Mühlbauer, Musab AlTurki, José Meseguer, and Martin Wirsing. 2012. Stable availability under denial of service attacks through formal patterns. In FASE. 78–93.

[32]

David K. Gifford. 1979. Weighted voting for replicated data. In SOSP. ACM, 150–162.

[33]

Wojciech Golab, Xiaozhou Li, and Mehul A. Shah. 2011. Analyzing consistency properties for fun and profit. In PODC’11. ACM, 197–206.

Digital Library

[34]

Jon Grov and Peter Csaba Ölveczky. 2014. Formal modeling and analysis of Google’s megastore in real-time Maude. In Specification, Algebra, and Software (LNCS), Vol. 8373. Springer.

[35]

C. Hawblitzel, J. Howell, M. Kapritsos, J. R. Lorch, B. Parno, M. L. Roberts, S. T. V. Setty, and B. Zill. 2015. IronFleet: Proving practical distributed systems correct. In SOSP. ACM.

[36]

Antonios Katsarakis, Yijun Ma, Zhaowei Tan, Andrew Bainbridge, Matthew Balkwill, Aleksandar Dragojevic, Boris Grot, Bozidar Radunovic, and Yongguang Zhang. 2021. Zeus: Locality-aware distributed transactions. In EuroSys. ACM, 145–161.

[37]

Kishori M. Konwar, Wyatt Lloyd, Haonan Lu, and Nancy A. Lynch. 2021. SNOW revisited: Understanding when ideal READ transactions are possible. In IPDPS’21. IEEE, 922–931.

[38]

M. Kwiatkowska, G. Norman, and D. Parker. 2011. PRISM 4.0: Verification of probabilistic real-time systems. In CAV’11 (LNCS), Vol. 6806. Springer, 585–591.

[39]

Rivka Ladin, Barbara Liskov, Liuba Shrira, and Sanjay Ghemawat. 1992. Providing high availability using lazy replication. ACM Trans. Comput. Syst. 10, 4 (1992), 360–391.

Digital Library

[40]

Collin Lee, Seo Jin Park, Ankita Kejriwal, Satoshi Matsushita, and John K. Ousterhout. 2015. Implementing linearizability at large scale and low latency. In SOSP. ACM, 71–86.

[41]

T. Leesatapornwongsa, M. Hao, P. Joshi, J. F. Lukman, and H. S. Gunawi. 2014. SAMC: Semantic-aware model checking for fast discovery of deep bugs in cloud systems. In OSDI. USENIX Association.

[42]

Mohsen Lesani, Christian J. Bell, and Adam Chlipala. 2016. Chapar: Certified causally consistent distributed key-value stores. In POPL’16. ACM, 357–370.

Digital Library

[43]

Si Liu. 2021. All in One: Design, Verification, and Implementation of SNOW-Optimal Read Atomic Transactions. Artifacts. Retrieved from https://github.com/siliunobi/lora.

[44]

Si Liu, Jatin Ganhotra, Muntasir Rahman, Son Nguyen, Indranil Gupta, and José Meseguer. 2017. Quantitative analysis of consistency in NoSQL key-value stores. Leibniz Trans. Embed. Syst. 4, 1 (2017), 03:1–03:26.

[45]

Si Liu, Peter Csaba Ölveczky, Jatin Ganhotra, Indranil Gupta, and José Meseguer. 2017. Exploring design alternatives for RAMP transactions through statistical model checking. In ICFEM (LNCS). Springer.

[46]

Si Liu, Peter Csaba Ölveczky, and José Meseguer. 2016. Modeling and analyzing mobile ad hoc networks in real-time Maude. J. Log. Algeb. Meth. Program. 85, 1 (2016), 34–66.

[47]

Si Liu, Peter Csaba Ölveczky, Muntasir Raihan Rahman, Jatin Ganhotra, Indranil Gupta, and José Meseguer. 2016. Formal modeling and analysis of RAMP transaction systems. In SAC. ACM.

[48]

Si Liu, Peter Csaba Ölveczky, Qi Wang, Indranil Gupta, and José Meseguer. 2019. Read atomic transactions with prevention of lost updates: ROLA and its formal analysis. Formal Asp. Comput. 31, 5 (2019), 503–540.

Digital Library

[49]

Si Liu, Peter Csaba Ölveczky, Min Zhang, Qi Wang, and José Meseguer. 2019. Automatic analysis of consistency properties of distributed transaction systems in maude. In TACAS’19 (LNCS), Vol. 11428. Springer, 40–57.

[50]

Si Liu, Muntasir Raihan Rahman, Stephen Skeirik, Indranil Gupta, and José Meseguer. 2014. Formal modeling and analysis of Cassandra in Maude. In ICFEM (LNCS), Vol. 8829. Springer.

[51]

Si Liu, Atul Sandur, José Meseguer, Peter Csaba Ölveczky, and Qi Wang. 2020. Generating correct-by-construction distributed implementations from formal Maude designs. In NFM’20 (LNCS), Vol. 12229. Springer.

[52]

Wyatt Lloyd, Michael J. Freedman, Michael Kaminsky, and David G. Andersen. 2011. Don’t settle for eventual: Scalable causal consistency for wide-area storage with COPS. In SOSP’11. ACM, 401–416.

Digital Library

[53]

Wyatt Lloyd, Michael J. Freedman, Michael Kaminsky, and David G. Andersen. 2013. Stronger semantics for low-latency geo-replicated storage. In NSDI. USENIX Association, 313–328.

[54]

Haonan Lu, Christopher Hodsdon, Khiem Ngo, Shuai Mu, and Wyatt Lloyd. 2016. The SNOW theorem and latency-optimal read-only transactions. In OSDI’16. USENIX Association, 135–150.

[55]

Haonan Lu, Siddhartha Sen, and Wyatt Lloyd. 2020. Performance-optimal read-only transactions. In OSDI. USENIX Association, 333–349.

[56]

José Meseguer. 1992. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci. 96, 1 (1992), 73–155.

Digital Library

[57]

José Meseguer. 1993. A logical theory of concurrent objects and its realization in the Maude language. In Research Directions in Concurrent Object-oriented Programming, Gul Agha, Peter Wegner, and Akinori Yonezawa (Eds.). The MIT Press, 314–390.

Digital Library

[58]

Microsoft. 2018. High-level TLA+ Specifications for the Five Consistency Levels Offered by Azure Cosmos DB. Retrieved from https://github.com/Azure/azure-cosmos-tla.

[59]

Shuai Mu, Yang Cui, Yang Zhang, Wyatt Lloyd, and Jinyang Li. 2014. Extracting more concurrency from distributed transactions. In OSDI. USENIX Association, 479–494.

[60]

MySQL. 2021. MySQL Cluster CGE. (2021). Retrieved from https://www. mysql.com/products/cluster/.

[61]

Jonathan Nadal. 2021. Stateright Actor Framework. Retrieved from https://www.stateright.rs.

[62]

C. Newcombe, T. Rath, F. Zhang, B. Munteanu, M. Brooker, and M. Deardeuff. 2015. How Amazon Web Services uses formal methods. Commun. ACM 58, 4 (Apr. 2015), 66–73.

Digital Library

[63]

Chris Newcombe, Tim Rath, Fan Zhang, Bogdan Munteanu, Mark Brooker, and Michael Deardeuff. 2015. How Amazon Web Services uses formal methods. Commun. ACM 58, 4 (2015), 66–73.

Digital Library

[64]

Peter Csaba Ölveczky. 2016. Formalizing and validating the P-store replicated data store in Maude. In WADT’16 (LNCS), Vol. 10644. Springer, 189–207.

[65]

Peter Csaba Ölveczky and José Meseguer. 2008. The real-time Maude tool. In TACAS (LNCS), Vol. 4963. Springer, 332–336.

[66]

Christos H. Papadimitriou. 1979. The serializability of concurrent database updates. J. ACM 26, 4 (Oct. 1979), 631–653.

Digital Library

[67]

Lin Qiao, Kapil Surlaker, Shirshanka Das, Tom Quiggle, Bob Schulman, Bhaskar Ghosh, Antony Curtis, Oliver Seeliger, Zhen Zhang, Aditya Auradkar, Chris Beaver, Gregory Brandt, Mihir Gandhi, Kishore Gopalakrishna, Wai Ip, Swaroop Jagadish, Shi Lu, Alexander Pachev, Aditya Ramesh, Abraham Sebastian, Rupa Shanbhag, Subbu Subramaniam, Yun Sun, Sajid Topiwala, Cuong Tran, Jemiah Westerman, and David Zhang. 2013. On brewing fresh espresso: LinkedIn’s distributed data serving platform. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’13), New York, NY, USA, June 22-27, 2013, Kenneth A. Ross, Divesh Srivastava, and Dimitris Papadias. ACM, 1135–1146.

Digital Library

[68]

Vincent Rahli, Ivana Vukotic, Marcus Völp, and Paulo Jorge Esteves Veríssimo. 2018. Velisarios: Byzantine fault-tolerant protocols powered by Coq. In ESOP (LNCS), Vol. 10801. Springer, 619–650.

[69]

Koushik Sen, Mahesh Viswanathan, and Gul Agha. 2005. On statistical model checking of stochastic systems. In CAV’05 (LNCS), Vol. 3576. Springer.

[70]

Ilya Sergey, James R. Wilcox, and Zachary Tatlock. 2017. Programming and proving with distributed protocols. Proc. ACM Program. Lang. 2, POPL (2017).

Digital Library

[71]

Stephen Skeirik, Rakesh B. Bobba, and José Meseguer. 2013. Formal analysis of fault-tolerant group key management using ZooKeeper. In CCGRID. 636–641.

[72]

Stephen Skeirik, José Meseguer, and Camilo Rocha. 2020. Verification of the IBOS browser security properties in reachability logic. In WRLA (LNCS), Vol. 12328. Springer, 176–196.

[73]

Stephen Skeirik, Andrei Stefanescu, and José Meseguer. 2017. A constructor-based reachability logic for rewrite theories. In LOPSTR (LNCS), Vol. 10855. Springer, 201–217.

[74]

Yair Sovran, Russell Power, Marcos K. Aguilera, and Jinyang Li. 2011. Transactional storage for geo-replicated systems. In SOSP’11. ACM, 385–400.

Digital Library

[75]

Kristina Spirovska, Diego Didona, and Willy Zwaenepoel. 2019. PaRiS: Causally consistent transactions with non-blocking reads and partial replication. In ICDCS’19. IEEE, 304–316.

[76]

Christoph Sprenger, Tobias Klenze, Marco Eilers, Felix A. Wolf, Peter Müller, Martin Clochard, and David A. Basin. 2020. Igloo: Soundly linking compositional refinement and separation logic for distributed system verification. Proc. ACM Program. Lang. 4, OOPSLA (2020), 152:1–152:31.

Digital Library

[77]

Douglas B. Terry, Alan J. Demers, Karin Petersen, Mike Spreitzer, Marvin Theimer, and Brent B. Welch. 1994. Session guarantees for weakly consistent replicated data. In PDIS. IEEE Computer Society, 140–149.

[78]

Douglas B. Terry, Vijayan Prabhakaran, Ramakrishna Kotla, Mahesh Balakrishnan, Marcos K. Aguilera, and Hussam Abu-Libdeh. 2013. Consistency-based service level agreements for cloud storage. In SOSP. ACM, 309–324.

[79]

Alejandro Z. Tomsic, Manuel Bravo, and Marc Shapiro. 2018. Distributed transactional reads: The strong, the quick, the fresh & the impossible. In Middleware. ACM, 120–133.

[80]

Uppaal. 2019. Uppaal 4.0.15. Retrieved from http://www.uppaal.org.

[81]

Hiroshi Wada, Alan Fekete, Liang Zhao, Kevin Lee, and Anna Liu. 2011. Data consistency properties and the trade-offs in commercial cloud storage: The consumers’ perspective. In CIDR. 134–143.

[82]

Anduo Wang, Alexander J. T. Gurney, Xianglong Han, Jinyan Cao, Boon Thau Loo, Carolyn L. Talcott, and Andre Scedrov. 2014. A reduction-based approach towards scaling up formal analysis of internet configurations. In INFOCOM. IEEE, 637–645.

[83]

Qi Wang, Pubali Datta, Wei Yang, Si Liu, Adam Bates, and Carl A. Gunter. 2019. Charting the attack surface of trigger-action IoT platforms. In CCS. ACM, 1439–1453.

[84]

Xingda Wei, Jiaxin Shi, Yanzhe Chen, Rong Chen, and Haibo Chen. 2015. Fast in-memory transaction processing using RDMA and HTM. In SOSP. ACM, 87–104.

[85]

Brian White, Jay Lepreau, Leigh Stoller, Robert Ricci, Shashi Guruprasad, Mac Newbold, Mike Hibler, Chad Barb, and Abhijeet Joglekar. 2002. An integrated experimental environment for distributed systems and networks. In OSDI. USENIX Association.

Digital Library

[86]

James R. Wilcox, Doug Woos, Pavel Panchekha, Zachary Tatlock, Xi Wang, Michael D. Ernst, and Thomas Anderson. 2015. Verdi: A framework for implementing and formally verifying distributed systems. In PLDI’15. ACM, 357–368.

Digital Library

[87]

J. Yang, T. Chen, M. Wu, Z. Xu, X. Liu, H. Lin, M. Yang, F. Long, L. Zhang, and L. Zhou. 2009. MODIST: Transparent model checking of unmodified distributed systems. In NSDI. USENIX Association, 213–228.

[88]

Håkan L. S. Younes and Reid G. Simmons. 2006. Statistical probabilistic model checking with a focus on time-bounded properties. Inf. Comput. 204, 9 (2006), 1368–1409.

Digital Library

[89]

Irene Zhang, Naveen Kr. Sharma, Adriana Szekeres, Arvind Krishnamurthy, and Dan R. K. Ports. 2015. Building consistent transactions with inconsistent replication. In SOSP. ACM, 263–278.

Cited By

Liu SGu LWei HBasin D(2024)Plume: Efficient and Complete Black-Box Checking of Weak Isolation LevelsProceedings of the ACM on Programming Languages10.1145/36897428:OOPSLA2(876-904)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689742
Liu SMultazzu LWei HBasin D(2024)NOC-NOC: Towards Performance-optimal Distributed TransactionsProceedings of the ACM on Management of Data10.1145/36392642:1(1-25)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639264
Chakraborty PAlfadel MNagappan M(2024)RLocator: Reinforcement Learning for Bug LocalizationIEEE Transactions on Software Engineering10.1109/TSE.2024.345259550:10(2695-2708)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1109/TSE.2024.3452595
Show More Cited By

Index Terms

All in One: Design, Verification, and Implementation of SNOW-optimal Read Atomic Transactions
1. Information systems
  1. Data management systems
    1. Database administration
      1. Database performance evaluation
    2. Database management system engines
      1. Distributed database transactions
2. Software and its engineering
  1. Software notations and tools
    1. Development frameworks and environments
  2. Software organization and properties
    1. Software functional properties
      1. Formal methods

Recommendations

Design, verification and applications of a new read-write lock algorithm
SPAA '12: Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures

Coordination and synchronization of parallel tasks is a major source of complexity in parallel programming. These constructs take many forms in practice including directed barrier and point-to-point synchronizations, termination detection of child tasks,...
Performance-optimal read-only transactions
OSDI'20: Proceedings of the 14th USENIX Conference on Operating Systems Design and Implementation

Read-only transactions are critical for consistently reading data spread across a distributed storage system but have worse performance than simple, non-transactional reads. We identify three properties of simple reads that are necessary for read-only ...
Design and verification of long-running transactions in a timed framework

Long-running transactions consist of tasks which may be executed sequentially and in parallel, may contain subtasks, and may require to be completed before a deadline. These transactions are not atomic and, in case of executions which cannot be ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Software Engineering and Methodology

ACM Transactions on Software Engineering and Methodology Volume 31, Issue 3

July 2022

912 pages

ISSN:1049-331X

EISSN:1557-7392

DOI:10.1145/3514181

Editor:
Mauro Pezzè
USI Università della Svizzera italiana and SIT Schaffhausen Institute of Technology, Switzerland

Issue’s Table of Contents

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].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 March 2022

Accepted: 01 October 2021

Revised: 01 September 2021

Received: 01 May 2021

Published in TOSEM Volume 31, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
381
Total Downloads

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

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Liu SGu LWei HBasin D(2024)Plume: Efficient and Complete Black-Box Checking of Weak Isolation LevelsProceedings of the ACM on Programming Languages10.1145/36897428:OOPSLA2(876-904)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689742
Liu SMultazzu LWei HBasin D(2024)NOC-NOC: Towards Performance-optimal Distributed TransactionsProceedings of the ACM on Management of Data10.1145/36392642:1(1-25)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639264
Chakraborty PAlfadel MNagappan M(2024)RLocator: Reinforcement Learning for Bug LocalizationIEEE Transactions on Software Engineering10.1109/TSE.2024.345259550:10(2695-2708)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1109/TSE.2024.3452595
Arwan ARochimah SFatichah C(2023)Feature Location Using Extraction of Code DocumentationProceedings of the 8th International Conference on Sustainable Information Engineering and Technology10.1145/3626641.3627149(481-488)Online publication date: 24-Oct-2023
https://dl.acm.org/doi/10.1145/3626641.3627149
Liu SMeseguer JÖlveczky PZhang MBasin D(2022)Bridging the semantic gap between qualitative and quantitative models of distributed systemsProceedings of the ACM on Programming Languages10.1145/35632996:OOPSLA2(315-344)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1145/3563299
Weghorn TLiu SSprenger CPerrig ABasin D(2022)N-Tube: Formally Verified Secure Bandwidth Reservation in Path-Aware Internet Architectures2022 IEEE 35th Computer Security Foundations Symposium (CSF)10.1109/CSF54842.2022.9919646(147-162)Online publication date: Aug-2022
https://doi.org/10.1109/CSF54842.2022.9919646

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 Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Full Text

View this article in Full Text.

HTML Format

View this article in HTML Format.

Media

Figures

Other

Tables

View full text|Download PDF

View Issue’s Table of Contents