System-level testing assignment for hypercubes with lower fault bounds

Dajin Wang, Zhongxian Wang

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

The maximum allowed number of faulty processors in an n-dimensional hypercube system is n under PMC model for diagnosis. When the n fault bound is adopted, all links will be used to perform diagnosis. However, if the fault bound is lower than n, 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 can free 2n-1 links from diagnosis. We present an algorithm that selects, in a systematic way, the to-be-freed links. For a fault-bound-drop by k, the proposed algorithm will produce an (n-k)-diagnosable system that remains connected and symmetrically structured. The freed links will never be used for the purpose of diagnosis, so that the diagnosis and some normal computation can be carried out simultaneously, improving the performance of the system as a whole.

Original languageEnglish
Pages (from-to)136-142
Number of pages7
JournalConference Proceedings - International Phoenix Conference on Computers and Communications
StatePublished - 1 Jan 1995
EventProceedings of the 1995 IEEE 14th Annual International Phoenix Conference on Computers and Communications - Scottsdale, AZ, USA
Duration: 28 Mar 199531 Mar 1995

Fingerprint

Testing

Cite this

@article{430c9f1d67574880b922f2396d1d2255,
title = "System-level testing assignment for hypercubes with lower fault bounds",
abstract = "The maximum allowed number of faulty processors in an n-dimensional hypercube system is n under PMC model for diagnosis. When the n fault bound is adopted, all links will be used to perform diagnosis. However, if the fault bound is lower than n, 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 can free 2n-1 links from diagnosis. We present an algorithm that selects, in a systematic way, the to-be-freed links. For a fault-bound-drop by k, the proposed algorithm will produce an (n-k)-diagnosable system that remains connected and symmetrically structured. The freed links will never be used for the purpose of diagnosis, so that the diagnosis and some normal computation can be carried out simultaneously, improving the performance of the system as a whole.",
author = "Dajin Wang and Zhongxian Wang",
year = "1995",
month = "1",
day = "1",
language = "English",
pages = "136--142",
journal = "Conference Proceedings - International Phoenix Conference on Computers and Communications",
issn = "0896-582X",

}

System-level testing assignment for hypercubes with lower fault bounds. / Wang, Dajin; Wang, Zhongxian.

In: Conference Proceedings - International Phoenix Conference on Computers and Communications, 01.01.1995, p. 136-142.

Research output: Contribution to journalConference article

TY - JOUR

T1 - System-level testing assignment for hypercubes with lower fault bounds

AU - Wang, Dajin

AU - Wang, Zhongxian

PY - 1995/1/1

Y1 - 1995/1/1

N2 - The maximum allowed number of faulty processors in an n-dimensional hypercube system is n under PMC model for diagnosis. When the n fault bound is adopted, all links will be used to perform diagnosis. However, if the fault bound is lower than n, 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 can free 2n-1 links from diagnosis. We present an algorithm that selects, in a systematic way, the to-be-freed links. For a fault-bound-drop by k, the proposed algorithm will produce an (n-k)-diagnosable system that remains connected and symmetrically structured. The freed links will never be used for the purpose of diagnosis, so that the diagnosis and some normal computation can be carried out simultaneously, improving the performance of the system as a whole.

AB - The maximum allowed number of faulty processors in an n-dimensional hypercube system is n under PMC model for diagnosis. When the n fault bound is adopted, all links will be used to perform diagnosis. However, if the fault bound is lower than n, 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 can free 2n-1 links from diagnosis. We present an algorithm that selects, in a systematic way, the to-be-freed links. For a fault-bound-drop by k, the proposed algorithm will produce an (n-k)-diagnosable system that remains connected and symmetrically structured. The freed links will never be used for the purpose of diagnosis, so that the diagnosis and some normal computation can be carried out simultaneously, improving the performance of the system as a whole.

UR - http://www.scopus.com/inward/record.url?scp=0029238347&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0029238347

SP - 136

EP - 142

JO - Conference Proceedings - International Phoenix Conference on Computers and Communications

JF - Conference Proceedings - International Phoenix Conference on Computers and Communications

SN - 0896-582X

ER -