Diagnosability of Two-Matching Composition Networks

摘要：

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.

作者: Sun-Yuan Hsieh Chia-Wei Lee

作者单位: Department of Computer Science and Information Engineering,National Cheng Kung University,No. 1, University Road, Tainan 70101, Taiwan

会议类型: 国际会议

会议名称: The 4th Annual International Computing and Combinatorics Conference,COCOON 2008(第14届国际计算和组合会议)

会议地点: 大连

会议语种:英文

页码: 478-486

在线出版日期: 2008-06-01（万方平台首次上网日期，不代表论文的发表时间）