The g-good-neighbor diagnosability of (n,k)-star graphs

详细信息    查看全文

• 作者：Xiang Xu^a ; Xiaowang Li^a ; Shuming Zhou^a ; ^b ; ^{zhoushuming@fjnu.edu.cn} ; Rong-Xia Hao^c ; Mei-Mei Gu^c
• 关键词：Multiprocessor systems ; (n ; k)(n ; k)-star graphs ; PMC model ; MM* model ; Diagnosability ; The g-good-neighbor diagnosability
• 刊名：Theoretical Computer Science
• 出版年：2017
• 出版时间：10 January 2017
• 年：2017
• 卷：659
• 期：Complete
• 页码：53-63
• 全文大小：395 K
• 卷排序：659

文摘

We explore fault diagnosability of multiprocessor systems based on combinatorial network theory. We establish the g  -good-neighbor diagnosability of the (n,k)(n,k)-star graph Sn,kSn,k under the PMC model. We establish the g  -good-neighbor diagnosability of the (n,k)(n,k)-star graph Sn,kSn,k under the comparison model.