The DASH prototype: implementation and performance
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Reconfiguring Processor Arrays Using Multiple-Track Models: The 3Track-Spare-Approach
IEEE Transactions on Computers
Distributed Identification of All Maximal Incomplete Subcubes in a Faulty Hypercube
Proceedings of the 8th International Symposium on Parallel Processing
Proceedings of the The IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems
Fault Tolerant Algorithms for a Linear Array with a Reconfigurable Pipelined Bus System
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
| Hi-index | 0.00 |
Torus/mesh-based machines have received increasing attention. It is natural to identify the maximum healthy submeshes in a faulty torus/mesh so as to lower potential performance degradation, because the time for executing a parallel algorithm tends to depend on the size of the assigned submesh. This paper proposes an efficient approach for identifying all the maximum healthy submeshes present in a faulty torus/mesh. The proposed approach is based on manipulating set expressions, with the search space reduced considerably by taking advantage of the interesting properties of a faulty torus/mesh.