Complexity of distributed commit protocols

DOI10.1007/BF00263581MaRDI QIDQ1822970zbMATH OpenOpenAlexFDO

Authors 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

atomic actionsdistributed systemfail-stop failureslower and upper boundsprotocols

Mathematics Subject Classification ID

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

Recommendations

• The Communication Complexity of Atomic Commitment and of Gossiping
• Design of transaction commitment protocols
• Transaction commit in a realistic timing model
• An efficient fault-tolerant decentralized commit protocol
• Fault-tolerant distributed computing

Cited in

(12)

• An optimal distributed algorithm for recognizing mesh-connected networks
• A distributed critical section protocol for general topology
• Multi-shot distributed transaction commit
• The Communication Complexity of Atomic Commitment and of Gossiping
• The Complexity of Distributed Concurrency Control
• scientific article; zbMATH DE number 915978 (Why is no real title available?)
• Multi-shot distributed transaction commit
• Silence
• Continuation Complexity: A Callback Hell for Distributed Systems
• Analysis of an epoch commit protocol for distributed processing systems
• Design of transaction commitment protocols
• A theorem on atomicity in distributed algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822970)