The Community for Technology Leaders
Green Image
Issue No. 03 - March (2001 vol. 12)
ISSN: 1045-9219
pp: 272-282
ABSTRACT
<p><b>Abstract</b>—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. This procedure is a distributed one, because every healthy node performs the same procedure independently and concurrently. We show that the proposed scheme may outperform previous methods.</p>
INDEX TERMS
Distributed algorithms, faulty meshes, faulty tori, prime submeshes, reconfiguration, set expressions.
CITATION

H. Chen and S. Hu, "Submesh Determination in Faulty Tori and Meshes," in IEEE Transactions on Parallel & Distributed Systems, vol. 12, no. , pp. 272-282, 2001.
doi:10.1109/71.914767
95 ms
(Ver 3.3 (11022016))