Minimum Assignment of Test Links for Hypercubes with Lower Fault Bounds
Document Type
Article
Publication Date
2-1-1997
Abstract
In ann-dimensional hypercube multiprocessor system, to correctly diagnose faulty processors among themselves, the maximum allowed number of faulty processors isnunder the well-known PMC diagnostic model. When thenfault bound is adopted, all links between processors will be used in the diagnosis. However, if the fault bound is lower thann, many links can be freed from the task of performing diagnosis. In this paper, we show that each drop of the fault bound by 1 will free 2n-1links from diagnosis. We will present an algorithm that selects, in a symmetric manner, the to-be-freed links, so that only a minimum number of links will be used to perform diagnosis. A rigorous proof for the algorithm's correctness is given. The freed links will never be used for the purpose of diagnosis, so that the diagnosis and some conventional computations may be carried out simultaneously, improving the performance of the system as a whole.
DOI
10.1006/jpdc.1996.1279
Montclair State University Digital Commons Citation
Wang, Dajin and Wang, Zhongxian, "Minimum Assignment of Test Links for Hypercubes with Lower Fault Bounds" (1997). Department of Computer Science Faculty Scholarship and Creative Works. 401.
https://digitalcommons.montclair.edu/compusci-facpubs/401