On sequential diagnosis of multiprocessor systems

Authors:
T. Yamada;T. Ohtsuka;A. Watanabe;S. Ueno
Affiliations:
Department of Information and Computer Sciences, Saitama University, Saitama 338-8570, Japan;Department of Communications and Integrated Systems, Graduate School of Science and Engineering, Tokyo Institute of Technology, Tokyo 152-8552-53-57, Japan;Department of Communications and Integrated Systems, Graduate School of Science and Engineering, Tokyo Institute of Technology, Tokyo 152-8552-53-57, Japan;Department of Communications and Integrated Systems, Graduate School of Science and Engineering, Tokyo Institute of Technology, Tokyo 152-8552-53-57, Japan
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 6
Cited 1

On a problem of Yuzvinsky on separating the n-cube

Discrete Mathematics
Introduction to algorithms

Introduction to algorithms
Sequential Diagnosability is Co-NP Complete

IEEE Transactions on Computers
A linear time algorithm for sequential diagnosis in hypercubes

Journal of Parallel and Distributed Computing
A Graph Partitioning Approach to Sequential Diagnosis

IEEE Transactions on Computers
Characterization of Connection Assignment of Diagnosable Systems

IEEE Transactions on Computers

Interactive Communication, Diagnosis and Error Control in Networks

Algorithmics of Large and Complex Networks

Quantified Score

Hi-index	0.04

Visualization

Abstract

This paper considers the problem of sequential fault diagnosis for various multiprocessor systems. We propose a simple sequential diagnosis algorithm and show that the degree of sequential diagnosability of any system with N processors is at least @W(N). We also show upper bounds for various networks. These are the first nontrivial upper bounds for the degree of sequential diagnosability, to the best of our knowledge. Our upper bounds are proved in a unified manner, which is based on the very definition of sequential diagnosability. We show that a d-dimensional grid and torus with N vertices are sequentially O(N^d^/^(^d^+^1^))-diagnosable, and an N-vertex k-ary tree is O(kN)-diagnosable. Moreover, we prove that the degree of sequential diagnosability of an N-vertex hypercube is at least @W(N/logN) and at most O(NloglogN/logN), and those of an N-vertex CCC, shuffle-exchange graph, and de Bruijn graph are @Q(N/logN).