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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Hsieh, S. Y., & Lee, C. W. (2008). Diagnosability of two-matching composition networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5092 LNCS, pp. 478–486). https://doi.org/10.1007/978-3-540-69733-6_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
