Computing the (t,k)-diagnosability of component-composition graphs and its application

Sun Yuan Hsieh, Chun An Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

(t,k)-Diagnosis, which is a generalization of sequential diagnosis, requires that at least k faulty processors should be identified and repaired in each iteration provided there are at most t faulty processors, where t ≥ k. Let κ(G) and n(G) be the node connectivity and the number of nodes in G, respectively. We show that the class of m-dimensional component-composition graphs G for m ≥ 4 is (Ω(h),κ(G))-diagnosable, where h = 2 m-2 x lg (m-1)/m-1 if 2m-1 ≤ n(G) < m!; and h = 2m-2 if n(G) ≥ m!. Based on this result, the (t,k)-diagnosability of numerous multiprocessor systems can be computed efficiently.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 21st International Symposium, ISAAC 2010, Proceedings
Pages363-374
Number of pages12
EditionPART 2
DOIs
Publication statusPublished - 2010 Dec 1
Event21st Annual International Symposium on Algorithms and Computations, ISAAC 2010 - Jeju Island, Korea, Republic of
Duration: 2010 Dec 152010 Dec 17

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume6507 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other21st Annual International Symposium on Algorithms and Computations, ISAAC 2010
CountryKorea, Republic of
CityJeju Island
Period10-12-1510-12-17

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Computing the (t,k)-diagnosability of component-composition graphs and its application'. Together they form a unique fingerprint.

Cite this