DocumentCode :
2502692
Title :
Probabilistic diagnosis of multiprocessor systems with arbitrary connectivity
Author :
Fussell, D. ; Rangarajan, S.
Author_Institution :
Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
fYear :
1989
fDate :
21-23 June 1989
Firstpage :
560
Lastpage :
565
Abstract :
Presents probabilistic fault diagnosis algorithms and a comparison-based fault model for homogeneous systems where the probability of correct diagnosis approaches one when the number of tests conducted on each processor grows slightly faster than log N. For a comparison-based model, this means that each processor has to compare its result on test jobs with a constant number of other processors where the number of test jobs grows slightly faster than log N. These algorithms do not require the neighborhood of processors to grow and thus could be used on systems with arbitrary processor graphs with the in-degree of each processor being greater than a specified value, which in most practical situations is two. Also, diagnosis decisions are made in a distributed fashion. The asymptotic performance of the algorithm is considered.<>
Keywords :
failure analysis; fault tolerant computing; multiprocessing systems; probability; arbitrary connectivity; arbitrary processor graphs; asymptotic performance; comparison-based fault model; distributed decision making; homogeneous systems; in-degree; multiprocessor systems; probabilistic fault diagnosis algorithms; test jobs; Algorithm design and analysis; Contracts; Fault diagnosis; Multiprocessing systems; Performance evaluation; System testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Fault-Tolerant Computing, 1989. FTCS-19. Digest of Papers., Nineteenth International Symposium on
Conference_Location :
Chicago, IL, USA
Print_ISBN :
0-8186-1959-7
Type :
conf
DOI :
10.1109/FTCS.1989.105636
Filename :
105636
Link To Document :
بازگشت