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.
|Number of pages||10|
|Journal||IEEE Transactions on Dependable and Secure Computing|
|Publication status||Published - 2011 Jan 26|
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering