Journal
INFORMATION SCIENCES
Volume 246, Issue -, Pages 177-190Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2013.04.038
Keywords
Fault tolerance; Comparison diagnosis; Diagnosability; (n, k)-Arrangement graph
Categories
Funding
- National Natural Science Foundation of China [61072080, 11071233]
- Fujian Province Department of Education A-Class Project [JA12073]
- Natural Science Foundation of Fujian Province-Fault diagnosis and location of network systems
- Key Project of Fujian Provincial Universities services to the western coast of the straits-Information Technology Research Based on Mathematics
Ask authors/readers for more resources
The growing size of the multiprocessor system increases its vulnerability to component failures. It is crucial to locate and to replace the faulty processors to maintain a system's high reliability. The fault diagnosis is the process of identifying faulty processors in a system through testing. In this paper, we show that the largest connected component of the survival graph contains almost all of the remaining vertices in the (n, k)-arrangement graph A(n,k) when the number of moved faulty vertices is up to twice or three times the traditional connectivity. Using this fault resiliency, we establish the conditional diagnosability of A(n,k) under the comparison model, and prove that the conditional diagnosability of A(n,k) is (3k - 2)(n - k) - 3 for k >= 4, n >= k + 2; and the conditional diagnosability of A(n,n-1) is 3n - 7 for n >= 5. (C) 2013 Published by Elsevier Inc.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available