Issue No. 11 - November (1983 vol. 32)
K.V.S. Bhat , Department of Computer Science, University of Iowa
In this correspondence a O(n3)-time algorithm for fault diagnosis in an n-cube connected array of processors is presented using the notion of candidate processors and syndrome information digraphs.
syndrome information digraph, Candidate processors, distributed processing, efficient algorithms, fault diagnosis, n-cube connected arrays
K.V.S. Bhat, "An Efficient Approach for Fault Diagnosis in a Boolean n-Cube Array of Microprocessors", IEEE Transactions on Computers, vol. 32, no. , pp. 1070-1071, November 1983, doi:10.1109/TC.1983.1676161