Transient Fault Detectors

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

doi:10.1007/bfb0056474

Transient Fault Detectors

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

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Distributed Computing - 12th International Symposium, DISC 1998, Proceedings
Editors	Shay Kutten
Publisher	Springer Verlag
Pages	62-74
Number of pages	13
ISBN (Print)	3540650660, 9783540650669
DOIs	https://doi.org/10.1007/bfb0056474
State	Published - 1 Jan 1998
Event	12th International Symposium on Distributed Computing, DISC 1998 - Andros, Greece Duration: 24 Sep 1998 → 26 Sep 1998

Publication series

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

Conference

Conference	12th International Symposium on Distributed Computing, DISC 1998
Country/Territory	Greece
City	Andros
Period	24/09/98 → 26/09/98

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science (all)

Access to Document

10.1007/bfb0056474

Cite this

Beauquier, J., Delaët, S., Dolev, S., & Tixeuil, S. (1998). Transient Fault Detectors. In S. Kutten (Ed.), Distributed Computing - 12th International Symposium, DISC 1998, Proceedings (pp. 62-74). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1499). Springer Verlag. https://doi.org/10.1007/bfb0056474

@inproceedings{d7b65e8be7074df7896fe465eb965797,

title = "Transient Fault Detectors",

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.",

author = "Joffroy Beauquier and Sylvie Dela{\"e}t and Shlomi Dolev and S{\'e}bastien Tixeuil",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 12th International Symposium on Distributed Computing, DISC 1998 ; Conference date: 24-09-1998 Through 26-09-1998",

year = "1998",

month = jan,

day = "1",

doi = "10.1007/bfb0056474",

language = "English",

isbn = "3540650660",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "62--74",

editor = "Shay Kutten",

booktitle = "Distributed Computing - 12th International Symposium, DISC 1998, Proceedings",

address = "Germany",

}

Beauquier, J, Delaët, S, Dolev, S & Tixeuil, S 1998, Transient Fault Detectors. in S Kutten (ed.), Distributed Computing - 12th International Symposium, DISC 1998, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1499, Springer Verlag, pp. 62-74, 12th International Symposium on Distributed Computing, DISC 1998, Andros, Greece, 24/09/98. https://doi.org/10.1007/bfb0056474

Transient Fault Detectors. / Beauquier, Joffroy; Delaët, Sylvie; Dolev, Shlomi et al.
Distributed Computing - 12th International Symposium, DISC 1998, Proceedings. ed. / Shay Kutten. Springer Verlag, 1998. p. 62-74 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1499).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Transient Fault Detectors

AU - Beauquier, Joffroy

AU - Delaët, Sylvie

AU - Dolev, Shlomi

AU - Tixeuil, Sébastien

PY - 1998/1/1

Y1 - 1998/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84947936463&partnerID=8YFLogxK

U2 - 10.1007/bfb0056474

DO - 10.1007/bfb0056474

M3 - Conference contribution

AN - SCOPUS:84947936463

SN - 3540650660

SN - 9783540650669

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 62

EP - 74

BT - Distributed Computing - 12th International Symposium, DISC 1998, Proceedings

A2 - Kutten, Shay

PB - Springer Verlag

T2 - 12th International Symposium on Distributed Computing, DISC 1998

Y2 - 24 September 1998 through 26 September 1998

ER -

Transient Fault Detectors

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this