Diagnosability of component-Composition graphs in the mm* model

Chia Wei Lee; Sun-Yuan Hsieh

doi:10.1145/2611759

Diagnosability of component-Composition graphs in the mm* model

Chia Wei Lee, Sun-Yuan Hsieh

Department of Computer Science and Information Engineering

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

Diagnosability is an important metric for measuring the reliability of multiprocessor systems. This article adopts the MM* model and outlines the common properties of a wide class of interconnection networks, called component-composition graphs (CCGs), to determine their diagnosability by using their obtained properties. By applying the results to multiprocessor systems, the diagnosability of hypercube-like networks (including hypercubes, crossed cubes, Möbius cubes, twisted cubes, locally twisted cubes, generalized twisted cubes,and recursive circulants), star graphs, pancake graphs, bubble-sort graphs, and burnt pancake graphs, all of which belong to the class of CCGs, can also be computed.

Original language	English
Article number	27
Journal	ACM Transactions on Design Automation of Electronic Systems
Volume	19
Issue number	3
DOIs	https://doi.org/10.1145/2611759
Publication status	Published - 2014 Jan 1

All Science Journal Classification (ASJC) codes

Computer Science Applications
Computer Graphics and Computer-Aided Design
Electrical and Electronic Engineering

Access to Document

10.1145/2611759

Fingerprint Dive into the research topics of 'Diagnosability of component-Composition graphs in the mm* model'. Together they form a unique fingerprint.

Cite this

@article{aaf204ca48c64035b4a490ddb3e3b59f,

title = "Diagnosability of component-Composition graphs in the mm* model",

abstract = "Diagnosability is an important metric for measuring the reliability of multiprocessor systems. This article adopts the MM* model and outlines the common properties of a wide class of interconnection networks, called component-composition graphs (CCGs), to determine their diagnosability by using their obtained properties. By applying the results to multiprocessor systems, the diagnosability of hypercube-like networks (including hypercubes, crossed cubes, M{\"o}bius cubes, twisted cubes, locally twisted cubes, generalized twisted cubes,and recursive circulants), star graphs, pancake graphs, bubble-sort graphs, and burnt pancake graphs, all of which belong to the class of CCGs, can also be computed.",

author = "Lee, {Chia Wei} and Sun-Yuan Hsieh",

year = "2014",

month = jan,

day = "1",

doi = "10.1145/2611759",

language = "English",

volume = "19",

journal = "ACM Transactions on Design Automation of Electronic Systems",

issn = "1084-4309",

publisher = "Association for Computing Machinery (ACM)",

number = "3",

}

TY - JOUR

T1 - Diagnosability of component-Composition graphs in the mm* model

AU - Lee, Chia Wei

AU - Hsieh, Sun-Yuan

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Diagnosability is an important metric for measuring the reliability of multiprocessor systems. This article adopts the MM* model and outlines the common properties of a wide class of interconnection networks, called component-composition graphs (CCGs), to determine their diagnosability by using their obtained properties. By applying the results to multiprocessor systems, the diagnosability of hypercube-like networks (including hypercubes, crossed cubes, Möbius cubes, twisted cubes, locally twisted cubes, generalized twisted cubes,and recursive circulants), star graphs, pancake graphs, bubble-sort graphs, and burnt pancake graphs, all of which belong to the class of CCGs, can also be computed.

AB - Diagnosability is an important metric for measuring the reliability of multiprocessor systems. This article adopts the MM* model and outlines the common properties of a wide class of interconnection networks, called component-composition graphs (CCGs), to determine their diagnosability by using their obtained properties. By applying the results to multiprocessor systems, the diagnosability of hypercube-like networks (including hypercubes, crossed cubes, Möbius cubes, twisted cubes, locally twisted cubes, generalized twisted cubes,and recursive circulants), star graphs, pancake graphs, bubble-sort graphs, and burnt pancake graphs, all of which belong to the class of CCGs, can also be computed.

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

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

U2 - 10.1145/2611759

DO - 10.1145/2611759

M3 - Article

AN - SCOPUS:84902990922

VL - 19

JO - ACM Transactions on Design Automation of Electronic Systems

JF - ACM Transactions on Design Automation of Electronic Systems

SN - 1084-4309

IS - 3

M1 - 27

ER -