RT Journal Article
JF Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on
YR 1997
VO 00
IS
SP 97
TI Finding Maximal Submeshes in Faulty 2D Mesh in the Presence of Failed Nodes
A1 Seong-Moo Yoo,
A1 Hee Yong Youn,
K1
AB In a parallel computer system with faulty processors, it is highly desirable to reconfigure the system by eliminating the faulty ones and thereby restore the system to some operational state. In the reconfiguration finding the maximum size fault-free subsystem is the main problem. In this paper, we propose an efficient scheme for identifying maximum size fault-free submeshes in a faulty two-dimensional(2D) mesh system. For this, the relations between two submeshes in a 2D mesh have been defined. Then we take two phase approach. In the first phase, an efficient algorithm for determining maximal faulty submeshes in a faulty mesh has been introduced. In the second phase, we have introduced a procedure to identify the maximal fault-free submeshes by splitting all faulty submeshes from a whole mesh. The time complexity of the proposed scheme is O(N_f^2) where N_f is the number of faulty processors in a 2D mesh. The proposed scheme can be utilized to the task allocation in 2D meshes in the presence of failed nodes.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN
LA English
DO 10.1109/AISPAS.1997.581637
LK http://doi.ieeecomputersociety.org/10.1109/AISPAS.1997.581637