Cart (Loading....) | Create Account
Close category search window
 

A Local Diagnosability Measure for Multiprocessor Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Guo-Huang Hsu ; Nat. Chiao Tung Univ., Hsinchu ; Tan, J.J.M.

The problem of fault diagnosis has been discussed widely and the diagnosability of many well-known networks has been explored. Under the PMC model, we introduce a new measure of diagnosability, called local diagnosability, and derive some structures for determining whether a vertex of a system is locally t-diagnosable. For a hypercube, we prove that the local diagnosability of each vertex is equal to its degree under the PMC model. Then, we propose a concept for system diagnosis, called the strong local diagnosability property. A system G(V, E) is said to have a strong local diagnosability property if the local diagnosability of each vertex is equal to its degree. We show that an n-dimensional hypercube Qn has this strong property, nges3. Next, we study the local diagnosability of a faulty hypercube. We prove that Qn keeps this strong property even if it has up to n-2 faulty edges. Assuming that each vertex of a faulty hypercube Qn is incident with at least two fault-free edges, we prove Qn keeps this strong property even if it has up to 3(n-2)-1 faulty edges. Furthermore, we prove that Qn keeps this strong property no matter how many edges are faulty, provided that each vertex of a faulty hypercube Qn is incident with at least three fault-free edges. Our bounds on the number of faulty edges are all tight

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:18 ,  Issue: 5 )

Date of Publication:

May 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.