Reducing the Number of Sequential Diagnosis Iterations in Hypercubes

Authors:
Paolo Santi;Stefano Chessa
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
2004

Citing 6
Cited 3

Introduction to algorithms

Introduction to algorithms
A linear time algorithm for sequential diagnosis in hypercubes

Journal of Parallel and Distributed Computing
Adaptive System-Level Diagnosis for Hypercube Multiprocessors

IEEE Transactions on Computers
A Graph Partitioning Approach to Sequential Diagnosis

IEEE Transactions on Computers
Better Adaptive Diagnosis of Hypercubes

IEEE Transactions on Computers
Diagnosability of regular systems

Journal of Algorithms

Performance analysis of an evolutionary algorithm for fault detection in t-diagnosable multi-processor systems

International Journal of Parallel, Emergent and Distributed Systems
On diagnosability of large multiprocessor networks

Discrete Applied Mathematics
Interactive Communication, Diagnosis and Error Control in Networks

Algorithmics of Large and Complex Networks

Quantified Score

Hi-index	14.98

Visualization

Abstract

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\in\Theta(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.