Strongly diagnosable product networks under the comparison diagnosis model

Sun-Yuan Hsieh, Yu Shu Chen

Research output: Contribution to journalArticle

44 Citations (Scopus)

Abstract

The notion of diagnosability has long played an important role in measuring the reliability of multiprocessor systems. Such a system is t-diagnosable if all faulty nodes can be identified without replacement when the number of faults does not exceed t, where t is some positive integer. Furthermore, a system is strongly t-diagnosable if it can achieve (t+1)-diagnosability, except for the case where a node's neighbors are all faulty. In this paper, we investigate the strong diagnosability of a class of product networks, under the comparison diagnosis model. Based on our results, we can determine the strong diagnosability of several widely used multiprocessor systems, such as hypercubes, mesh-connected k-ary n-cubes, torus-connected k-ary n-cubes, and hyper Petersen networks.

Original languageEnglish
Pages (from-to)721-732
Number of pages12
JournalIEEE Transactions on Computers
Volume57
Issue number6
DOIs
Publication statusPublished - 2008 Jun 1

Fingerprint

Diagnosability
K-ary N-cubes
Multiprocessor Systems
Vertex of a graph
Hypercube
Model
Replacement
Torus
Exceed
Fault
Mesh
Integer

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

@article{a370227c63054ffdb8057f23e6bec41f,
title = "Strongly diagnosable product networks under the comparison diagnosis model",
abstract = "The notion of diagnosability has long played an important role in measuring the reliability of multiprocessor systems. Such a system is t-diagnosable if all faulty nodes can be identified without replacement when the number of faults does not exceed t, where t is some positive integer. Furthermore, a system is strongly t-diagnosable if it can achieve (t+1)-diagnosability, except for the case where a node's neighbors are all faulty. In this paper, we investigate the strong diagnosability of a class of product networks, under the comparison diagnosis model. Based on our results, we can determine the strong diagnosability of several widely used multiprocessor systems, such as hypercubes, mesh-connected k-ary n-cubes, torus-connected k-ary n-cubes, and hyper Petersen networks.",
author = "Sun-Yuan Hsieh and Chen, {Yu Shu}",
year = "2008",
month = "6",
day = "1",
doi = "10.1109/TC.2008.30",
language = "English",
volume = "57",
pages = "721--732",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "6",

}

Strongly diagnosable product networks under the comparison diagnosis model. / Hsieh, Sun-Yuan; Chen, Yu Shu.

In: IEEE Transactions on Computers, Vol. 57, No. 6, 01.06.2008, p. 721-732.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Strongly diagnosable product networks under the comparison diagnosis model

AU - Hsieh, Sun-Yuan

AU - Chen, Yu Shu

PY - 2008/6/1

Y1 - 2008/6/1

N2 - The notion of diagnosability has long played an important role in measuring the reliability of multiprocessor systems. Such a system is t-diagnosable if all faulty nodes can be identified without replacement when the number of faults does not exceed t, where t is some positive integer. Furthermore, a system is strongly t-diagnosable if it can achieve (t+1)-diagnosability, except for the case where a node's neighbors are all faulty. In this paper, we investigate the strong diagnosability of a class of product networks, under the comparison diagnosis model. Based on our results, we can determine the strong diagnosability of several widely used multiprocessor systems, such as hypercubes, mesh-connected k-ary n-cubes, torus-connected k-ary n-cubes, and hyper Petersen networks.

AB - The notion of diagnosability has long played an important role in measuring the reliability of multiprocessor systems. Such a system is t-diagnosable if all faulty nodes can be identified without replacement when the number of faults does not exceed t, where t is some positive integer. Furthermore, a system is strongly t-diagnosable if it can achieve (t+1)-diagnosability, except for the case where a node's neighbors are all faulty. In this paper, we investigate the strong diagnosability of a class of product networks, under the comparison diagnosis model. Based on our results, we can determine the strong diagnosability of several widely used multiprocessor systems, such as hypercubes, mesh-connected k-ary n-cubes, torus-connected k-ary n-cubes, and hyper Petersen networks.

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

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

U2 - 10.1109/TC.2008.30

DO - 10.1109/TC.2008.30

M3 - Article

AN - SCOPUS:44049106991

VL - 57

SP - 721

EP - 732

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 6

ER -