This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamic Fault Reconfiguration in a Mesh-Connected MIMD Environment
October 1988 (vol. 37 no. 10)
pp. 1191-1205
ASCII Text
x 
 
M.U. Uyar, A.P. Reeves, "Dynamic Fault Reconfiguration in a Mesh-Connected MIMD Environment," IEEE Transactions on Computers, vol. 37, no. 10, pp. 1191-1205, October, 1988.
 
 
BibTex
x
 
@article{ 10.1109/12.5981,
author = {M.U. Uyar and A.P. Reeves},
title = {Dynamic Fault Reconfiguration in a Mesh-Connected MIMD Environment},
journal ={IEEE Transactions on Computers},
volume = {37},
number = {10},
issn = {0018-9340},
year = {1988},
pages = {1191-1205},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.5981},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Dynamic Fault Reconfiguration in a Mesh-Connected MIMD Environment
IS - 10
SN - 0018-9340
SP1191
EP1205
EPD - 1191-1205
A1 - M.U. Uyar,
A1 - A.P. Reeves,
PY - 1988
KW - dynamic default reconfiguration; mesh-connected MIMD environment; near-neighbor problem; parallel matrix operation; highly parallel computer systems; fault tolerance; processor failures; data transfers; fault tolerant computing; parallel processing.
VL - 37
JA - IEEE Transactions on Computers
ER -
 
The near-neighbor problem is characterized by many iterations of a parallel matrix operation in which each matrix element is recomputed as a function of itself and its immediately adjacent near neighbors. Several highly parallel computer systems have been designed with the near-neighbor class of problems as the target application. As the number of processors in evolving parallel computer system

[1] W. J. Bouknight, S. A. Denenberg, D. E. McIntyre, J. M. Randall, A. H. Sameh, and D. L. Slotnick, "The Illiac IV system,"Proc. IEEE, no. 60, pp. 369-388, 1972.
[2] K. E. Batcher, "Design of a massively parallel processor,"IEEE Trans. Comput., vol. C-29, pp. 836-840, Sept. 1980.
[3] A. P. Reeves, "Fault tolerance in highly parallel mesh connected processors," inComputing Structures for Image Processing, M. J. Duff, Ed. New York: Academy, 1983, pp. 77-94.
[4] I. A. Baqai and T. Lang, "Reliability aspects of the Illiac IV computer," inProc. 1976 Int. Conf. Parallel Processing, Aug. 1976, pp. 123-131.
[5] M. U. Uyar, "Dynamic fault reconfiguration in multiprocessor systems," Ph.D. dissertation, School of Elec. Eng., Cornell Univ., Ithaca, NY, June 1986.
[6] M. U. Uyar and A. P. Reeves, "Fault reconfiguration in a distributed MIMD environment with a multistage network," inProc. 1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 798-806.
[7] D. K. Pradhan, "Fault-tolerant architectures for multiprocessors and VLSI systems," inProc. 13th Int. Symp. Fault-Tolerant Comput., June 1983, pp. 436-441.
[8] A. P. Reeves and C. H. Jeon, "Computer vision task decomposition," inLanguages, Architectures and Algorithms On A Multicluster MIMD System, M. J. Duff, Ed. New York: Academy, 1985.
[9] S. H. Hosseini, J. G. Kuhl, and S. M. Reddy, "A diagnosis algorithm for distributed computing systems,"IEEE Trans. Comput., vol. C- 33, pp. 223-233, Mar. 1984.
[10] A. T. Dahbura, G. M. Masson, and C.-L. Yang, "Self-implicating structures for diagnosable systems,"IEEE Trans. Comput., vol. C-34, pp. 718-723, Aug. 1985.
[11] A. P. Reeves, "The local median and other window operations on SIMD computers,"Computer Graph. Image Processing, vol. 19, pp. 165-177, 1982.

Index Terms:
dynamic default reconfiguration; mesh-connected MIMD environment; near-neighbor problem; parallel matrix operation; highly parallel computer systems; fault tolerance; processor failures; data transfers; fault tolerant computing; parallel processing.
Citation:
M.U. Uyar, A.P. Reeves, "Dynamic Fault Reconfiguration in a Mesh-Connected MIMD Environment," IEEE Transactions on Computers, vol. 37, no. 10, pp. 1191-1205, Oct. 1988, doi:10.1109/12.5981
Usage of this product signifies your acceptance of the Terms of Use.