共 32 条
Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model
被引:2
作者:
Ding, Tongtong
[1
]
Xu, Min
[1
]
机构:
[1] Beijing Normal Univ, Sch Math Sci, Lab Math & Complex Syst, Minist Educ, Beijing 100875, Peoples R China
基金:
中国国家自然科学基金;
关键词:
Diagnosability;
Non -inclusive diagnosability;
PMC model;
CONDITIONAL DIAGNOSABILITY;
NETWORKS;
ALGORITHM;
D O I:
10.1016/j.tcs.2022.12.026
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
Diagnosability, defined as the maximum number of fault processors that the system can recognize, is an important parameter in the design and maintenance of multiprocessor systems. To improve diagnosability, Ding et al. [5] proposed the non-inclusive diagnosabil-ity. In this paper, we discuss the relationship between the diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model. We use the non -inclusive diagnosability of some regular graphs as examples in our discussion.(c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:9
相关论文