TY - GEN
T1 - A Tree Structure for Local Diagnosis in Multiprocessor Systems Under Comparison Model
AU - Chen, Meirun
AU - Lin, Cheng Kuan
AU - Pai, Kung Jui
N1 - Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
PY - 2022
Y1 - 2022
N2 - If we only care about the status of a particular vertex, instead of doing global diagnosis, Hsu and Tan introduced the concept of local diagnosis and proposed an extended star structure to diagnose a vertex under comparison model. Usually, there is a gap between the local diagnosability and the lower bound guaranteed by the extended star structure mentioned above. In this paper, we propose a new testing structure and corresponding diagnosis algorithm to diagnose a vertex under comparison model to better evaluate the local diagnosability. The local diagnosability of a vertex is upper bounded by its degree in the system. If the local diagnosability of each vertex equals to its degree in the system then we say this system has the strong local diagnosability property. Based on the new structure, we show that the n-dimensional star graph Sn with faulty links has the strong local diagnosability property provided that each vertex connects to at least three fault-free links. Simulations are presented to show the performance of our tree structure.
AB - If we only care about the status of a particular vertex, instead of doing global diagnosis, Hsu and Tan introduced the concept of local diagnosis and proposed an extended star structure to diagnose a vertex under comparison model. Usually, there is a gap between the local diagnosability and the lower bound guaranteed by the extended star structure mentioned above. In this paper, we propose a new testing structure and corresponding diagnosis algorithm to diagnose a vertex under comparison model to better evaluate the local diagnosability. The local diagnosability of a vertex is upper bounded by its degree in the system. If the local diagnosability of each vertex equals to its degree in the system then we say this system has the strong local diagnosability property. Based on the new structure, we show that the n-dimensional star graph Sn with faulty links has the strong local diagnosability property provided that each vertex connects to at least three fault-free links. Simulations are presented to show the performance of our tree structure.
UR - http://www.scopus.com/inward/record.url?scp=85151001782&partnerID=8YFLogxK
U2 - 10.1007/978-981-19-9582-8_5
DO - 10.1007/978-981-19-9582-8_5
M3 - Conference contribution
AN - SCOPUS:85151001782
SN - 9789811995811
T3 - Communications in Computer and Information Science
SP - 49
EP - 60
BT - New Trends in Computer Technologies and Applications - 25th International Computer Symposium, ICS 2022, Proceedings
A2 - Hsieh, Sun-Yuan
A2 - Hung, Ling-Ju
A2 - Peng, Sheng-Lung
A2 - Klasing, Ralf
A2 - Lee, Chia-Wei
PB - Springer Science and Business Media Deutschland GmbH
T2 - 25th International Computer Symposium on New Trends in Computer Technologies and Applications, ICS 2022
Y2 - 15 December 2022 through 17 December 2022
ER -