The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM⁎ model.
Theoretical Computer Science(2016)
摘要
Diagnosability is an important metric for measuring the reliability of multiprocessor systems. In 2012, Peng et al. proposed a new measure for fault diagnosis of the system, which is called g-good-neighbor diagnosability that restrains every fault-free node containing at least g fault-free neighbors. As a favorable topology structure of interconnection networks, the Cayley graph CΓn generated by the transposition tree Γn has many good properties. In this paper, we give that the 2-good-neighbor diagnosability of CΓn under the PMC model and MM⁎ model is g(n−2)−1, where n≥4 and g is the girth of CΓn.
更多查看译文
关键词
Interconnection network,Graph,Diagnosability,PMC model,MM⁎ model,Cayley graph,2-Good-neighbor diagnosability
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要