A framework for designing concurrent and recoverable abstract data types based on commutativity
Carmelo Malta, Jos\'e Martinez (LINA)

TL;DR
This paper introduces a new framework for designing concurrent and recoverable abstract data types that leverage commutativity to enhance concurrency and simplify recovery in transactional systems.
Contribution
It presents novel features based on conditional commutativity that improve concurrency and recovery, not previously documented in the literature.
Findings
Increased concurrency in transactional systems
Simplified recovery process
Novel features based on conditional commutativity
Abstract
In this paper, we try to focus the reader's interest on the problems that transactional systems have to resolve for taking advantage of commutativity in a serializable and recoverable way. Our framework is, (as others), based on the use of conditional commutativity on abstract date types. We present new features that have not been found in the literature hitherto, that both increase concurrency and simplify recovery.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Cryptography and Data Security · Advanced Database Systems and Queries
