Diagnosability of two-matching composition networks

Sun-Yuan Hsieh, Chia Wei Lee

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

4 Citations (Scopus)

Abstract

Diagnosability is an important metric for measuring the reliability of multiprocessor systems. In this paper, we study the diagnosability of a class of networks, called Two-Matching Composition Networks (2-MCNs), each of which is constructed by connecting two graphs via two perfect matchings. By applying our result to multiprocessor systems, we also compute the diagnosability of folded hypercubes and augmented cubes, both of which belong to two-matching composition networks.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 14th Annual International Conference, COCOON 2008, Proceedings
Pages478-486
Number of pages9
DOIs
Publication statusPublished - 2008 Aug 4
Event14th Annual International Conference on Computing and Combinatorics, COCOON 2008 - Dalian, China
Duration: 2008 Jun 272008 Jun 29

Publication series

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

Other

Other14th Annual International Conference on Computing and Combinatorics, COCOON 2008
Country/TerritoryChina
CityDalian
Period08-06-2708-06-29

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Diagnosability of two-matching composition networks'. Together they form a unique fingerprint.

Cite this