Diagnosis of processor arrays
Authors:
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 48-54
Abstract
This paper introduces an approach to diagnosis of processor arrays, assuming that processors are horizontally, vertically and diagonally connected to their neighbors. The proposed algorithm subdivides the array into clusters containing nine processors and requires three steps. In the first step each cluster executes tests according to a rosace pattern, and clusters for which all test results were zero are classified as Z-Cs. The remaining cluster, which contain at least one fault, are classified NZ-Cs. In the second step. Z-Cs are combined into aggregates (ZACS) and one Z-ACs is identified as a fault-free core of the array. The third step leads to identification of the state (of faulty or non faulty) of more nodes. The diagnosis is proved to be correct, although possibly incomplete, assuming that the number of faults is less that a bound T, which is an increasing function of the size of the array.Keywords
This publication has 8 references indexed in Scilit:
- Distributed diagnosis algorithms for regular interconnected structuresIEEE Transactions on Computers, 1992
- Implementation of online distributed system-level diagnosis theoryIEEE Transactions on Computers, 1992
- Distributed diagnosis and the system userIEEE Transactions on Computers, 1988
- Distributed Fault-Tolerance of Tree StructuresIEEE Transactions on Computers, 1987
- Self-Diagnosis in Distributed SystemsIEEE Transactions on Computers, 1985
- System Diagnosis with RepairIEEE Transactions on Computers, 1980
- A Theory of Diagnosability of Digital SystemsIEEE Transactions on Computers, 1976
- On the Connection Assignment Problem of Diagnosable SystemsIEEE Transactions on Electronic Computers, 1967