The Strong Diagnosability of Regular Networks and Product Networks under the PMC Model

Authors:
Sun-Yuan Hsieh;Tsung-Yen Chuang
Affiliations:
National Cheng Kung University, Tainan;National Cheng Kung University, Tainan
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2009

Citing 0
Cited 5

Diagnosability of star graphs with missing edges

Information Sciences: an International Journal
A general technique to establish the asymptotic conditional diagnosability of interconnection networks

Theoretical Computer Science
Conditional diagnosability of balanced hypercubes under the PMC model

Information Sciences: an International Journal
Conditional diagnosability of matching composition networks under the MM* model

Information Sciences: an International Journal
Wide-diameter of Product Graphs

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Strong diagnosability is a more precise concept for measuring the reliability of multiprocessor systems than the traditional global measurement. In this paper, we study the strong diagnosability of multiprocessor systems under the PMC model. Our main objective is to determinate the strong diagnosability of two wide classes of networks, namely regular networks and product networks, subject to certain conditions. Based on our results, we demonstrate the strong diagnosability of several well-known networks, including variants of hypercubes and many others.