Optimal Approximate Agreement with Omission Faults

Authors:
Richard Plunkett;Alan Fekete
Affiliations:
-;-
Venue:
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Year:
1998

Citing 6
Cited 1

Reaching approximate agreement in the presence of faults

Journal of the ACM (JACM)
Asynchronous approximate agreement

Information and Computation
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
New Hybrid Fault Models for Asynchronous Approximate Agreement

IEEE Transactions on Computers
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Reaching Approximate Agreement with Mixed-Mode Faults

IEEE Transactions on Parallel and Distributed Systems

Note: Strong order-preserving renaming in the synchronous message passing model

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Approximate agreement is a building block for fault-tolerant distributed systems. It is a formalisation for the basic operation of choosing a single real value (representing say speed) for use in later computation, reflecting the different approximations to this value reported from a number of possibly-faulty processors or sensors. We develope a new algorithm that can tolerate up to o send-omission faults. We analyse the convergence attained by this algorithm, and also give a matching universal bound on the convergence available to any algorithm no matter how complicated.