The G-Good-Neighbor Diagnosability Of Bubble-Sort Graphs Under Preparata, Metze, And Chien'S (Pmc) Model And Maeng And Malek'S (Mm)* Model
INFORMATION(2019)
摘要
Diagnosability of a multiprocessor system is an important topic of study. A measure for fault diagnosis of the system restrains that every fault-free node has at least g fault-free neighbor vertices, which is called the g-good-neighbor diagnosability of the system. As a famous topology structure of interconnection networks, the n-dimensional bubble-sort graph B-n has many good properties. In this paper, we prove that (1) the 1-good-neighbor diagnosability of B-n is 2n - 3 under Preparata, Metze, and Chien's (PMC) model for n >= 4 and Maeng and Malek's (MM)* model for n >= 5; (2) the 2-good-neighbor diagnosability of B-n is 4n - 9 under the PMC model and the MM* model for n >= 4; (3) the 3-good-neighbor diagnosability of B-n is 8n - 25 under the PMC model and the MM* model for n >= 7.
更多查看译文
关键词
interconnection network, graph, diagnosability, PMC model, MM* model, bubble-sort graph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络