In this note, we use a vertex-isoperimetric inequality to show that the number of test and repair iterations needed to perform sequential diagnosis of d-dimensional hypercubes is upper bounded by d-r, where rÎQ(d ). This result improves the best bound of d test and repair iterations previously known. Numerical evaluation has shown that the actual value of r ranges from 0.16d to 0.31d.

Reducing the number of sequential diagnosis iterations in hypercubes

P Santi;S Chessa
2004

Abstract

In this note, we use a vertex-isoperimetric inequality to show that the number of test and repair iterations needed to perform sequential diagnosis of d-dimensional hypercubes is upper bounded by d-r, where rÎQ(d ). This result improves the best bound of d test and repair iterations previously known. Numerical evaluation has shown that the actual value of r ranges from 0.16d to 0.31d.
2004
Istituto di informatica e telematica - IIT
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
Massively parallel systems
System-level diagnosis
Sequential diagnosis
Hypercubes
File in questo prodotto:
File Dimensione Formato  
prod_171670-doc_127761.pdf

solo utenti autorizzati

Descrizione: Reducing the number of sequential diagnosis iterations in hypercubes
Tipologia: Versione Editoriale (PDF)
Dimensione 299.58 kB
Formato Adobe PDF
299.58 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/147631
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 9
social impact