Fast non-blocking atomic commit: an inherent trade-off

Authors:
Partha Dutta;Rachid Guerraoui;Bastian Pochon
Affiliations:
Distributed Programming Laboratory, EPFL, CH-1015 Lausanne, Switzerland;Distributed Programming Laboratory, EPFL, CH-1015 Lausanne, Switzerland;Distributed Programming Laboratory, EPFL, CH-1015 Lausanne, Switzerland
Venue:
Information Processing Letters
Year:
2004

Citing 4
Cited 2

Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
Distributed Algorithms

Distributed Algorithms
Nonblocking commit protocols

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A simple proof of the uniform consensus synchronous lower bound

Information Processing Letters

Managed Agreement: Generalizing two fundamental distributed agreement problems

Information Processing Letters
Generating fast atomic commit from hyperfast consensus

LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of n processes may fail by crashing. We exhibit for t ≥ 3 an inherent trade-off between the fast abort property of NBAC, i.e., aborting a transaction as soon as possible if some process votes "no", and the fast commit property, i.e., committing a transaction as soon as possible when all processes vote "yes" and no process crashes. We also give two algorithms: the first satisfies fast commit and a weak variant of fast abort, whereas the second satisfies fast abort and a weak variant of fast commit.