Complexity of distributed commit protocols

DOI10.1007/BF00263581zbMath0679.68092OpenAlexW1996153819MaRDI QIDQ1822970

K. V. S. Ramarao

Publication date: 1989

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00263581

zbMATH Keywords

distributed systemlower and upper boundsprotocolsatomic actionsfail-stop failures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Theory of operating systems (68N25)

Related Items (3)

Multi-shot distributed transaction commit ⋮ Unnamed Item ⋮ An optimal distributed algorithm for recognizing mesh-connected networks

This page was built for publication: Complexity of distributed commit protocols