Limits of Commutativity on Abstract Data Types
Carmelo Malta, Jos\'e Martinez (LINA)

TL;DR
This paper explores the formal properties and limitations of symmetrical commutativity in transactional systems, revealing its advantages, disadvantages, and ways to circumvent its constraints for abstract data types.
Contribution
It provides a formal analysis of commutativity's limitations and advantages, and offers guidelines for overcoming these limits in transactional systems.
Findings
Commutativity shares limitations with compatibility for arbitrary objects.
Commutativity has beneficial properties related to recovery.
Strategies to circumvent commutativity limits are discussed.
Abstract
We present some formal properties of (symmetrical) commutativity, the major criterion used in transactional systems, which allow us to fully understand its advantages and disadvantages. The main result is that commutativity is subject to the same limitation as compatibility for arbitrary objects. However, commutativity has also a number of attracting properties, one of which is related to recovery and, to our knowledge, has not been exploited in the literature. Advantages and disadvantages are illustrated on abstract data types of interest. We also show how limits of commutativity have been circumvented, which gives guidelines for doing so (or not!).
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 · Logic, programming, and type systems · Logic, Reasoning, and Knowledge
