Title :
Diagnosability of Two-Matching Composition Networks under the MM{}^{ast} Model
Author :
Hsieh, Sun-Yuan ; Lee, Chia-Wei
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan
Abstract :
Diagnosability is an important metric for measuring the reliability of multiprocessor systems. In this paper, we study the diagnosability of a class of networks, called Two-Matching Composition Networks (2-MCNs), each of which is constructed by connecting two graphs via two perfect matchings. By applying our result to multiprocessor systems, we also compute the diagnosability of folded hypercubes and augmented cubes, both of which belong to two-matching composition networks.
Keywords :
fault diagnosis; graph theory; hypercube networks; multiprocessing systems; augmented cubes; diagnosability; folded hypercubes; graphs; multiprocessor systems; reliability; two-matching composition networks; Comparison diagnosis model; MM{}^{ast} model; diagnosability; graph theory; multiprocessor systems.; two-matching composition networks;
Journal_Title :
Dependable and Secure Computing, IEEE Transactions on
DOI :
10.1109/TDSC.2009.52