| Summary: | 碩士 === 國立暨南國際大學 === 資訊工程學系 === 97 === Fault-tolerant computing is very important for a massively parallel processing system and the reliability of processors in it is therefore becoming an important issue for designing the system. In order to achieve high system reliability and availability, a faulty processor (node) when it is found should be replaced by a fault-free processor. Within a multiprocessor system, the technique of identifying faulty nodes by constructing tests on the nodes and interpreting the test outcomes is known as system-level diagnosis. The topological structure of a multicomputer system can be modeled by a graph of which the vertices and edges correspond to nodes and links of the system, respectively. This work presents a system-level diagnosis algorithm for a generalized hypercube which is an attractive variance of a hypercube. The proposed algorithm is based on the PMC model and can isolate all faulty nodes to within a set which contains at most one fault-free node. If the total number of nodes to be diagnosed in a generalized hypercube is N, the proposed algorithm can run in O(NlogN) time, and, being superior to Yang’s algorithm proposed in 2004, it can diagnose not only a hypercube but also a generalized hypercube.
|
|---|
