High-performance ACID via modular concurrency control

Chao, Xie; Su, Chunzhi; Littley, Cody; Alvisi, Lorenzo; Kapritsos, Manos; Wang, Yan

doi:10.1145/2815400.2815430

Cited by 60 publications

(70 citation statements)

References 15 publications

(9 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Unification of multiple system huge logs. Observing long living distributed computations such as transactional systems replicated using SMR, may be a main requirement to automatically decompose transactions [333] and/or ensure that the workload is safe [332]. In these cases, if the workload changes or new operations are created, the whole system must be monitored, re-analyzed and re-deployed.…”

Section: Challengesmentioning

confidence: 99%

A survey of challenges for runtime verification from advanced application domains (beyond software)

Sánchez

Schneider

Ahrendt

et al. 2019

Form Methods Syst Des

View full text Add to dashboard Cite

Runtime verification is an area of formal methods that studies the dynamic analysis of execution traces against formal specifications. Typically, the two main activities in runtime verification efforts are the process of creating monitors from specifications, and the algorithms for the evaluation of traces against the generated monitors. Other activities involve the instrumentation of the system to generate the trace and the communication between the system under analysis and the monitor.Most of the applications in runtime verification have been focused on the dynamic analysis of software, even though there are many more potential applications to other computational devices and target systems. In this paper we present a collection of challenges for runtime verification extracted from concrete application domains, focusing on the difficulties that must be overcome to tackle these specific challenges. The computational models that characterize these domains require to devise new techniques beyond the current state of the art in runtime verification.

show abstract

Section: Challengesmentioning

confidence: 99%

A survey of challenges for runtime verification from advanced application domains (beyond software)

Sánchez

Schneider

Ahrendt

et al. 2019

Form Methods Syst Des

View full text Add to dashboard Cite

show abstract

“…In databases, nesting has been suggested many years ago [16,34,36]. More recent works introduced the concept of chopping [11,50,54], which also splits up transactions in order to reduce abort rates. Chopping was recently adopted in transactional memory [33,37,51].…”

Section: Related Workmentioning

confidence: 99%

Nesting and composition in transactional data structure libraries

Assa

Meir²,

Golan-Gueta

et al. 2020

Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

View full text Add to dashboard Cite

Transactional data structure libraries (TDSL) combine the ease-of-programming of transactions with the high performance and scalability of custom-tailored concurrent data structures. They can be very efficient thanks to their ability to exploit data structure semantics in order to reduce overhead, aborts, and wasted work compared to generalpurpose software transactional memory. However, TDSLs were not previously used for complex use-cases involving long transactions and a variety of data structures.In this paper, we boost the performance and usability of a TDSL, allowing it to support complex applications. A key idea is nesting. Nested transactions create checkpoints within a longer transaction, so as to limit the scope of abort, without changing the semantics of the original transaction. We build a Java TDSL with built-in support for nesting in a number of data structures. We conduct a case study of a complex network intrusion detection system that invests a significant amount of work to process each packet. Our study shows that our library outperforms TL2 twofold without nesting, and by up to 16x when nesting is used. Finally, we discuss crosslibrary nesting, namely dynamic composition of transactions from multiple libraries.

show abstract

“…The problem can also be addressed by adjusting the concurrency level adaptively, limiting the number of arriving transactions and/or using an exponential backoff for aborted transactions [28,38]. Transaction chopping partitions transactions into smaller pieces and executing dependent pieces in a chained manner [40,46,54]. Other work analyzes data accesses of transactions to expose [52].…”

Section: Related Workmentioning

confidence: 99%

“…Other work analyzes data accesses of transactions to expose [52]. It is also possible to reduce conflicts by executing transactions at heterogeneous isolation levels [53,54] or using a mix of optimistic and pessimistic concurrency control protocols [51]. While we also address the problem of reducing conflicts under data contention, our techniques are different from and complementary to previous work.…”

Section: Related Workmentioning

confidence: 99%

Improving optimistic concurrency control through transaction batching and operation reordering

2018

View full text Add to dashboard Cite

OLTP systems can often improve throughput by batching transactions and processing them as a group. Batching has been used for optimizations such as message packing and group commits; however, there is little research on the benefits of a holistic approach to batching across a transaction's entire life cycle. In this paper, we present a framework to incorporate batching at multiple stages of transaction execution for OLTP systems based on optimistic concurrency control. Storage batching enables reordering of transaction reads and writes at the storage layer, reducing conflicts on the same object. Validator batching enables reordering of transactions before validation, reducing conflicts between transactions. Dependencies between transactions make transaction reordering a non-trivial problem, and we propose several efficient and practical algorithms that can be customized to various transaction precedence policies such as reducing tail latency. We also show how to reorder transactions with a thread-aware policy in multi-threaded OLTP architecture without a centralized validator. In-depth experiments on a research prototype, an opensource OLTP system, and a production OLTP system show that our techniques increase transaction throughput by up to 2.2x and reduce their tail latency by up to 71% compared with the start-of-the-art systems on workloads with high data contention.

show abstract

High-performance ACID via modular concurrency control

Cited by 60 publications

References 15 publications

A survey of challenges for runtime verification from advanced application domains (beyond software)

A survey of challenges for runtime verification from advanced application domains (beyond software)

Nesting and composition in transactional data structure libraries

Improving optimistic concurrency control through transaction batching and operation reordering

Contact Info

Product

Resources

About