By Topic

A task graph centroid

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
$33 $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

3 Author(s)
C. Leangsuksun ; Dept. of Math. & Comput. Sci., Kent State Univ., OH, USA ; J. Potter ; S. Scott

When one is concerned with maximizing overall program throughput, task mapping in a heterogeneous computing environment presents the problem of which computing unit(s) is best suited to perform each task. This paper explores the concept that finding a “better” starting point for the static mapping process will provide a better opportunity for success. A starting point based on a computation task graph centroid, similar to that of masses in the gravity system, is derived such that the centroid of the task graph is the mapping starting point. Comparisons based on experimentation are then made using the HP Greedy mapping technique (Leangsuksun and Potter, 1994) while varying the starting point from beginning, centroid and end of the problem. Results show that the task centroid mapping technique does not increase the complexity of the mapping process but does result in an improved overall program throughput

Published in:

High Performance Distributed Computing, 1994., Proceedings of the Third IEEE International Symposium on

Date of Conference:

2-5 Aug 1994