计算机工程与应用2019，Vol.55Issue(4)：62-65,111,5.DOI:10.3778/j.issn.1002-8331.1806-0093
在PMC模型下单向k元n立方体的诊断度
Diagnosability of Unidirectional k-Ary n-Cubes Under PMC Model
摘要
Abstract
The connectivity and diagnosability of graphs are two parameters that are closely related to the reliability of interconnection networks. The g -good-neighbor connectivity and g -good-neighbor diagnosability are more accurate indexes than the connectivity and diagnosability. The k-ary n-cube is one of the most common interconnection networks for multiprocessor systems, and the unidirectional k-ary n-cube is the k-ary n-cube with simplex unidirectional links. This paper shows that the 1-good-neighbor connectivity, the diagnosability and the 1-good-neighbor diagnosability of the unidirectional k-ary n-cube under the PMC model are k (n-1), n and kn-1, respectively.关键词
有向网络/单向k元n立方体/诊断度/连通度/PMC模型Key words
directed network/ unidirectional k-ary n-cube/ diagnosability/ connectivity/ PMC model分类
数理科学引用本文复制引用
张雯丽,林上为,李艺海,郭慧铃..在PMC模型下单向k元n立方体的诊断度[J].计算机工程与应用,2019,55(4):62-65,111,5.基金项目
国家自然科学基金(No.61202017). （No.61202017）
