Ezhilchelvan PD

Reaching agreement in the presence of faults is a fundamental problem in fault tolerant distributed computing. This paper describes, and establishes the correctness of, algorithms for reaching distrubted agreement which are tolerant of faults of certain types. Fail-stop, omission, and timing faults are the three types of faults considered. Taking an upper bound on the number of processors that can possibly fail, an agreement algorithm is developed for each type of fault. Execution of these algorithms will be stopped early, when the number of processors that actually failed happens to be significantly less than the upper bound. It is observed that, for the same number of processor failures, the fail stop fault tolerant algorithm can be potentially faster than the omission fault tolerant algorithm which is in turn faster than the algorithm tolerant of timing faults

Early Stopping Algorithms for Distributed Agreement Under Fail-stop, Omission, and Timing Fault Types

Abstract

Similar works

Full text

Available Versions

Newcastle University E-Prints