G-good-neighbor diagnosability under the modified comparison model for multiprocessor systems
Diagnosing faults in multiprocessor systems has long been significant due to its performance impact and its blend of Graph Theory and Computer Science concepts. In 2012, Peng et al. introduced the g-good-neighbor diagnosability, ensuring every fault-free node has at least g fault-free neighbors. Thi...
Saved in:
Published in | Theoretical computer science Vol. 1028; p. 115027 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
28.02.2025
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!