TY - GEN
T1 - Diagnosability of the Lexicographic Product of Paths and Complete Bipartite Graphs Under PMC Model
AU - Chen, Bu
AU - Li, Feng
N1 - Publisher Copyright:
© IFIP International Federation for Information Processing 2025.
PY - 2025
Y1 - 2025
N2 - The processors within a multiprocessor system use an interconnection network for communication and data transmission, hence the structure of the interconnection network determines various aspects of the system’s performance. In the event of processor failures within the system, the system’s fault diagnosis capability is very significant. Diagnosability is the crucial parameter for evaluating the fault diagnosis capability of the interconnection network in multiprocessor systems. Studying diagnosability using diagnosis model such as the PMC model is beneficial for improving and optimizing multiprocessor systems. This paper uses the lexicographic product to generate a network structure Pm∘Kx,y which helps maintain the system’s parallel processing capability and high-performance computing. When m≥4, x+y≥5 and y>x, the diagnosability of Pm∘Kx,y under the PMC model is found to be 2x+y, and when 0≤h<2x+y, its h-edge fault tolerance diagnosability is 2x+y-h.
AB - The processors within a multiprocessor system use an interconnection network for communication and data transmission, hence the structure of the interconnection network determines various aspects of the system’s performance. In the event of processor failures within the system, the system’s fault diagnosis capability is very significant. Diagnosability is the crucial parameter for evaluating the fault diagnosis capability of the interconnection network in multiprocessor systems. Studying diagnosability using diagnosis model such as the PMC model is beneficial for improving and optimizing multiprocessor systems. This paper uses the lexicographic product to generate a network structure Pm∘Kx,y which helps maintain the system’s parallel processing capability and high-performance computing. When m≥4, x+y≥5 and y>x, the diagnosability of Pm∘Kx,y under the PMC model is found to be 2x+y, and when 0≤h<2x+y, its h-edge fault tolerance diagnosability is 2x+y-h.
KW - PMC model
KW - complete bipartite graphs
KW - diagnosability
KW - fault diagnosis
KW - h-edge tolerable diagnosability
KW - lexicographic product
KW - multiprocessor system
KW - paths
UR - https://www.scopus.com/pages/publications/105002384946
U2 - 10.1007/978-981-96-2830-8_4
DO - 10.1007/978-981-96-2830-8_4
M3 - 会议稿件
AN - SCOPUS:105002384946
SN - 9789819628292
T3 - Lecture Notes in Computer Science
SP - 41
EP - 52
BT - Network and Parallel Computing - 20th IFIP WG 10.3 International Conference, NPC 2024, Haikou, China, December 7–8, 2024, Proceedings
A2 - Chen, Xu
A2 - Min, Geyong
A2 - Guo, Deke
A2 - Xie, Xia
A2 - Pu, Lingjun
PB - Springer Science and Business Media Deutschland GmbH
T2 - 20th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2024
Y2 - 7 December 2024 through 8 December 2024
ER -