|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
An Efficient Approach for Fault Diagnosis in a Boolean n-Cube Array of Microprocessors
November 1983 (vol. 32 no. 11)
pp. 1070-1071
| ASCII Text | x | ||
| 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. 11, pp. 1070-1071, November, 1983. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1983.1676161, author = {K.V.S. Bhat}, title = {An Efficient Approach for Fault Diagnosis in a Boolean n-Cube Array of Microprocessors}, journal ={IEEE Transactions on Computers}, volume = {32}, number = {11}, issn = {0018-9340}, year = {1983}, pages = {1070-1071}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1983.1676161}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - An Efficient Approach for Fault Diagnosis in a Boolean n-Cube Array of Microprocessors IS - 11 SN - 0018-9340 SP1070 EP1071 EPD - 1070-1071 A1 - K.V.S. Bhat, PY - 1983 KW - syndrome information digraph KW - Candidate processors KW - distributed processing KW - efficient algorithms KW - fault diagnosis KW - n-cube connected arrays VL - 32 JA - IEEE Transactions on Computers ER - | |||
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.
Index Terms:
syndrome information digraph, Candidate processors, distributed processing, efficient algorithms, fault diagnosis, n-cube connected arrays
Citation:
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. 11, pp. 1070-1071, Nov. 1983, doi:10.1109/TC.1983.1676161
Usage of this product signifies your acceptance of the Terms of Use.

