Towards Efficient Abstractions for Concurrent Consensus
Carlo Spaccasassi, Vasileios Koutavas

TL;DR
This paper introduces a programming language with built-in consensus support via communicating transactions, addressing efficiency challenges and evaluating implementation strategies through experimental architecture to improve concurrent consensus mechanisms.
Contribution
It proposes a language design with integrated consensus constructs and evaluates various implementation heuristics for efficient execution in concurrent systems.
Findings
Communicating transactions effectively support consensus in concurrent programming.
Experimental evaluation identifies promising implementation heuristics.
The approach advances practical language support for consensus in distributed systems.
Abstract
Consensus is an often occurring problem in concurrent and distributed programming. We present a programming language with simple semantics and build-in support for consensus in the form of communicating transactions. We motivate the need for such a construct with a characteristic example of generalized consensus which can be naturally encoded in our language. We then focus on the challenges in achieving an implementation that can efficiently run such programs. We setup an architecture to evaluate different implementation alternatives and use it to experimentally evaluate runtime heuristics. This is the basis for a research project on realistic programming language support for consensus.
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 · Service-Oriented Architecture and Web Services · Logic, Reasoning, and Knowledge
