Transient Fault Detectors

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 solve) 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. Keywords Distributed Systems

• Type: Conference
• Year: 1998
• Where: WDAG
• Authors: Joffroy Beauquier, Sylvie Delaët, Shlomi Dolev, Sébastien Tixeuil
• Keywords: Algorithms, Failure Detectors, Fault Detectors, Transient Faults, WDAG 1998