Skip Navigation

The Computer Journal 2004 47(1):85-92; doi:10.1093/comjnl/47.1.85
© 2004 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Albini, L. C. P.
Right arrow Articles by Maestrini, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Diagnosis of Symmetric Graphs Under the BGM Model

L. C. P. Albini1,, S. Chessa2,§ and P. Maestrini1,¶

1 Istituto di Scienza e Tecnologie dell'Informazione, Area della Ricerca del CNR di Pisa, via Moruzzi 1, 56125 Pisa, Italy 2 Dipartimento di Informatica, University of Pisa, via Buonarroti 2, 56127 Pisa, Italy

This paper addresses the problem of the identification of faulty units in symmetric systems under the diagnostic model proposed by Barsi, Grandoni and Maestrini (hence called the BGM model). The paper introduces and evaluates an algorithm named Diagnosis Algorithm for Symmetric Systems under the BGM model (DABS). It is shown that DABS provides a diagnosis unconditionally correct although possibly incomplete. A measure of diagnosis incompleteness IDeg(t) has been defined as the quotient between the number of suspect units (i.e. the units that DABS is unable to identify as either good or faulty) and the number of system units. IDeg(t) is evaluated over the set of syndromes deriving from at most t faults under the BGM model. A general approach to the evaluation of IDeg(t) in symmetric systems is introduced, and tight bounds to IDeg(t) are derived for square toroidal grids and hypercubes. This bound is O(t/n) in the case of square toroidal grids of n units.

Received 2 July 2002. Revised 14 April 2003.

* Email: albini{at}iei.pi.cnr.it

§ Email: ste{at}di.unipi.it

Email: maestrini{at}iei.pi.cnr.it


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.