An efficient fault-tolerant decentralized commit protocol

DOI10.1016/0167-8191(94)90115-5MaRDI QIDQ1315920zbMATH OpenOpenAlexFDO

Authors S. M. Yuan

Publication date 24 March 1994

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(94)90115-5

zbMATH Keywords

commit protocolsdecentralized algorithmsdistributed database systemsfault-tolerant algorithmsmessage complexity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Database theory (68P15) Distributed algorithms (68W15)

Recommendations

• An efficient fault-tolerant decentralized commit protocol for single site failure
• Efficient Byzantine Fault-Tolerance
• Fault tolerant distributed majority commitment
• Resource-Efficient Byzantine Fault Tolerance

Cited in

(7)

• Increasing the resilience of distributed and replicated database systems
• Complexity of distributed commit protocols
• scientific article; zbMATH DE number 2088441 (Why is no real title available?)
• Reliable Timeout Based Commit Protocol
• Scalable sender-based message logging protocol with little communication overhead for distributed systems
• Design of transaction commitment protocols
• An efficient fault-tolerant decentralized commit protocol for single site failure

This page was built for publication: An efficient fault-tolerant decentralized commit protocol

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