Conditional Diagnosability of Arrangement Graphs Under the PMC Model
Document Type
Article
Publication Date
1-1-2014
Abstract
Processor fault diagnosis has played an important role in measuring the reliability of a multiprocessor system, and the diagnosabilities of many well-known multiprocessor systems have been investigated. The conditional diagnosability has been widely accepted as a measure of diagnosability by assuming an additional condition that any fault-set can't contain all the neighbors of any node in a multiprocessor system. This paper considers the conditional diagnosability of an (n, k)-arrangement graph An,k, a flexible interconnection network model for multiprocessor systems, under the classical PMC diagnostic model, and determines that the conditional diagnosability of An,k (k≥2, n≥k+2) is (4k-4)(n-k)-3, which is about four times its traditional diagnosability.
DOI
10.1016/j.tcs.2014.06.041
Montclair State University Digital Commons Citation
Lin, Limei; Zhou, Shuming; Xu, Li; and Wang, Dajin, "Conditional Diagnosability of Arrangement Graphs Under the PMC Model" (2014). Department of Computer Science Faculty Scholarship and Creative Works. 185.
https://digitalcommons.montclair.edu/compusci-facpubs/185