Transient Fault Detectors

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

Research output: Contribution to journalArticlepeer-review

20 Scopus citations

Abstract

We present fault detectors for transient faults, (i.e., corruptions of the memory of the processors, but not of the code of the processors). We distinguish fault detectors for tasks (i.e., the problem to be solved) from failure detectors for implementations (i.e., the algorithm that solves the problem). The aim of our fault detectors is to detect a memory corruption as soon as possible. We study the amount of memory needed by the fault detectors for some specific tasks, and give bounds for each task. The amount of memory is related to the size and the number of views that a processor has to maintain to ensure a quick detection. This work may give the implementation designer hints concerning the techniques and resources that are required for implementing a task.

Original languageEnglish
Pages (from-to)39-51
Number of pages13
JournalDistributed Computing
Volume20
Issue number1
DOIs
StatePublished - 5 Jun 2007

Keywords

  • Distributed systems
  • Fault detectors
  • Self-stabilization
  • Transient faults

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computational Theory and Mathematics

Fingerprint

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

Cite this