By Topic

Finding maximal submeshes in 2D mesh in the presence of failed nodes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Seong-Moo Yoo ; Dept. of Comput. Sci., Columbus State Univ., GA, USA ; Hee Yong Youn

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. 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 a 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(Nf2) where Nf 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

Published in:

Parallel Algorithms/Architecture Synthesis, 1997. Proceedings., Second Aizu International Symposium

Date of Conference:

17-21 Mar 1997