Toggle Main Menu Toggle Search

Open Access padlockePrints

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

Lookup NU author(s): Dr Paul Ezhilchelvan

Downloads


Abstract

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.


Publication metadata

Author(s): Ezhilchelvan PD

Publication type: Report

Publication status: Published

Series Title: Computing Laboratory Technical Report Series

Year: 1987

Pages: 17

Print publication date: 01/05/1987

Source Publication Date: May 1987

Report Number: 235

Institution: Computing Laboratory, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/papers/235.pdf


Share