Transaction commit in a realistic timing model

DOI10.1007/BF01786634zbMath0699.68116OpenAlexW1986945393MaRDI QIDQ913533

Brian A. Coan, Jennifer Lundelius Welch

Publication date: 1990

Published in: Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

lower boundfault tolerancetime boundsrandomized protocolsdistributed database systemstransaction commit

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Related Items (3)

Revisiting the relationship between non-blocking atomic commitment and consensus ⋮ Non-blocking atomic commit in asynchronous distributed systems with failure detectors ⋮ Hundreds of impossibility results for distributed computing

Cites Work

• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Simple constant-time consensus protocols in realistic failure models

This page was built for publication: Transaction commit in a realistic timing model