DocumentCode
2500551
Title
Ongoing fault diagnosis
Author
Hurwood, William
Author_Institution
Dept. of Math., Yale Univ., New Haven, CT, USA
fYear
1996
fDate
23-25 Oct 1996
Firstpage
108
Lastpage
117
Abstract
We consider a dynamic fault diagnosis problem: there are n processors, to be tested in a series of rounds. In every testing round we use a directed matching to have some processors report on the status (good or faulty) of other processors. Also, in each round up to t processors may break down, and we may direct that up to t processors are repaired. We show that it is possible to limit the number of faulty processors to O(t log2 t), even if the system is run indefinitely. We present an adversary which shows that this bound is optimal
Keywords
multiprocessing systems; computational complexity; directed matching; dynamic fault diagnosis; multiprocessor system; optimisation; Automatic testing; Distributed algorithms; Fault diagnosis; Fault tolerant systems; Mathematics; Performance evaluation; Protocols; System testing; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Reliable Distributed Systems, 1996. Proceedings., 15th Symposium on
Conference_Location
Nigara-on-the-Lake, Ont.
ISSN
1060-9857
Print_ISBN
0-8186-7481-4
Type
conf
DOI
10.1109/RELDIS.1996.559706
Filename
559706
Link To Document