Title :
Partitioning of even networks for improved diagnosability [multiprocessor systems]
Author_Institution :
Dept. of Electr. & Comput. Eng., Syracuse Univ., NY, USA
fDate :
8/1/1990 12:00:00 AM
Abstract :
A partitioning property of even interconnection networks is presented. This property is based on the Hadamard matrix combinatorial structure which is used to partition the network into identical spheres. A semidistributed diagnosis algorithm helps to identify faulty components (nodes/links) in each sphere. Using the diagnosis result of each sphere on a global level, the overall diagnosability or even networks is improved drastically over previous results. This partitioning and diagnosis scheme can be used for almost any network that has some group-theoretic representation, including the binary hypercube
Keywords :
combinatorial switching; fault tolerant computing; multiprocessor interconnection networks; reliability; Hadamard matrix combinatorial structure; binary hypercube; even interconnection networks; group-theoretic representation; multiprocessor systems; overall diagnosability; partitioning property; reliability; semidistributed diagnosis algorithm; Automatic testing; Combinatorial mathematics; Condition monitoring; Fault diagnosis; Fault tolerance; Hypercubes; Multiprocessing systems; Multiprocessor interconnection networks; Partitioning algorithms; System testing;
Journal_Title :
Reliability, IEEE Transactions on
