Transient Fault Detectors

Joffroy Beauquier, Sylvie Delaët, Shlomi Dolev, Sébastien Tixeuil

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

Abstract

In this paper we present failure detectors that detect transient failures, i.e. corruption of the system state without corrupting the program of the processors. We distinguish task which is the problem to solve, from implementation which is the algorithm that solve the problem. A task is specified as a desired output of the distributed system. The mechanism used to produce this output is not a concern of the task but a concern of the implementation. In addition we are able to classify both the distance locality and the history locality property of tasks. The distance locality is related to the diameter of the system configuration that a failure detector has to maintain in order to detect a transient fault. The history locality is related to the number of consecutive system configurations that a failure detector has to maintain in order to detect a transient fault.

Original languageEnglish
Title of host publicationDistributed Computing - 12th International Symposium, DISC 1998, Proceedings
EditorsShay Kutten
PublisherSpringer Verlag
Pages62-74
Number of pages13
ISBN (Print)3540650660, 9783540650669
DOIs
StatePublished - 1 Jan 1998
Event12th International Symposium on Distributed Computing, DISC 1998 - Andros, Greece
Duration: 24 Sep 199826 Sep 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1499
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Symposium on Distributed Computing, DISC 1998
Country/TerritoryGreece
CityAndros
Period24/09/9826/09/98

Fingerprint

Dive into the research topics of 'Transient Fault Detectors'. Together they form a unique fingerprint.

Cite this