Optimizing the costs of hierarchical quorum consensus

DOI10.1007/S002360050043MaRDI QIDQ1901698zbMATH OpenOpenAlexFDO

Authors Akhil Kumar, Kavindra Malik

Publication date 19 November 1995

Published in Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

quorum sizemix of read and write operations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1555940
• An optimal voting scheme for minimizing the overall communication cost in replicated data management
• scientific article; zbMATH DE number 2081022
• Message complexity of hierarchical quorum consensus algorithm
• Delay optimization in quorum consensus

Cites work

• A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data
• Exploiting logical structures in replicated databases

Cited in

(3)

• Quorum tree abstractions of consensus protocols
• scientific article; zbMATH DE number 1555940 (Why is no real title available?)
• Brief announcement: Hierarchical consensus

This page was built for publication: Optimizing the costs of hierarchical quorum consensus

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