
Accession Number : ADA310754
Title : A Graph Partitioning Approach to Sequential Diagnosis.
Corporate Author : PURDUE UNIV LAFAYETTE IN
Personal Author(s) : Khanna, Sanjeev ; Fuchs, W. K.
PDF Url : ADA310754
Report Date : 11 JUN 1996
Pagination or Media Count : 34
Abstract : This paper describes a generalized sequential diagnosis algorithm whose analysis leads to strong diagnosability results for a variety of multiprocessor interconnection topologies. The overall complexity of this algorithm in terms of total testing and syndrome decoding time is linear in the number of edges in the interconnection graph and the total number of iterations of diagnosis and repair needed by the algorithm is bounded by the diameter of the interconnection graph. The degree of diagnosability of this algorithm for a given interconnection graph is shown to be directly related to a graph parameter which we refer to as the partition number. We approximate this graph parameter for several interconnection topologies and thereby obtain lower bounds on degree of diagnosability achieved by our algorithm on these topologies.
Descriptors : *ALGORITHMS, *FAULT TOLERANT COMPUTING, MATHEMATICAL MODELS, SYSTEMS ENGINEERING, DISTRIBUTED DATA PROCESSING, COMPUTER COMMUNICATIONS, GRAPHS, SEQUENTIAL ANALYSIS, APPROXIMATION(MATHEMATICS), MULTIPROCESSORS, SYSTEMS ANALYSIS, COMPUTER AIDED DIAGNOSIS, DECODING.
Subject Categories : Operations Research
Computer Systems
Distribution Statement : APPROVED FOR PUBLIC RELEASE