Faster Transaction Commit even when Nodes Crash
Ryan Emerson, Paul Ezhilchelvan

TL;DR
This paper introduces a new protocol for in-memory transactions that ensures faster commit times even during node crashes by enabling uninterrupted progress without blocking.
Contribution
The paper presents a novel atomic broadcast protocol that maintains progress during node crashes, improving transaction commit speed and system availability.
Findings
Protocol achieves faster transaction commits during crashes.
System maintains progress without blocking during node failures.
Enhanced in-memory transaction reliability and performance.
Abstract
Atomic broadcasts play a central role in serialisable in-memory transactions. Best performing ones block, when a node crashes, until a new view is installed. We augment a new protocol for uninterrupted progress in the interim period.
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 · Cognitive Functions and Memory · Age of Information Optimization
