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

DOI10.1016/J.IPL.2004.04.006zbMath1177.68250OpenAlexW2130545950MaRDI QIDQ2390309

Rachid Guerraoui, Partha Sharathi Dutta, Bastian Pochon

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/64475

zbMATH Keywords

complexitydistributed algorithmsatomic commit

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (2)

Managed agreement: generalizing two fundamental distributed agreement problems ⋮ Fast non-blocking atomic commit: an inherent trade-off

Cites Work

• Unnamed Item
• A simple proof of the uniform consensus synchronous lower bound.
• Fast non-blocking atomic commit: an inherent trade-off
• Uniform consensus is harder than consensus

This page was built for publication: Fast non-blocking atomic commit: an inherent trade-off