By Topic

A spanning tree based recursive refinement algorithm for fast task mapping

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)
Jacob, J.C. ; Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA ; Lee, S.Y.

The early version of recursive refinement, an algorithm, for fast task mapping is reported in this paper. An intended application for this algorithm is dynamic load balancing on a parallel/distributed system, including a network of workstations. Since this requires a fast mapping, the algorithm restricts the range of tasks movement during optimization and maps groups of tasks to groups of PE's in each iteration. Tasks are allowed to be swapped only between the two partitions that comprise the parent partition from the previous iteration. More freedom of task movement is unnecessary because structural characteristics of the problem graph are used to guide the mapping. The groups are derived from a spanning tree that is constructed from the original problem graph and is used to identify the structural characteristics required for the algorithm. Experimental results show that the algorithm is able to achieve a mapping quality as good as that by another mapping scheme characteristic of a class of algorithms that require an order of magnitude more time

Published in:

High Performance Distributed Computing, 1995., Proceedings of the Fourth IEEE International Symposium on

Date of Conference:

2-4 Aug 1995