2002 · 34 citations · 16 references
ComputingComputer EngineeringComputer ScienceFault ToleranceFault-tolerant ComputingFault-tolerant SystemsData RedundancyDistributed ComputingFault Tolerance DesignHigh AvailabilityNetwork Fault ToleranceReliable Distributed SystemsFault-tolerant Distributed AlgorithmsFault-tolerant Distributed SystemsNetwork Partition ToleranceNetwork PartitioningQuorum SystemsQuorum-based Fault ToleranceQuorum-based ProtocolsQuorum-based Systems
The authors extend the concept of coterie into k-coterie for k entries to a critical section. A structure named Cohorts is proposed to construct quorums in a k-coterie. The solution is resilient to node failures and/or network partitioning and has a low communication cost. The Cohorts structure is further improved to increase the availabilities of 1-entry critical sections.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
16
How to assign votes in a distributed system
Héctor García-Molina, Daniel Barbará · Journal of the ACM · 1985 · 563 citations · Full text