The Community for Technology Leaders
Green Image
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
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.

M. Uyar and A. Reeves, "Dynamic Fault Reconfiguration in a Mesh-Connected MIMD Environment," in IEEE Transactions on Computers, vol. 37, no. , pp. 1191-1205, 1988.
79 ms
(Ver 3.3 (11022016))