By Topic

A high-performance mapping algorithm for heterogeneous computing systems

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)
Min-You Wu ; Dept. of Electr. & Comput. Eng., New Mexico Univ., Albuquerque, NM, USA ; Wei Shu

A mapping algorithm for heterogeneous computing systems is proposed in this paper. This algorithm utilizes a new indicator-the relative cost-to obtain optimal mapping. The existing Min-min algorithm can be well explained under synergy of this new indicator. It is found that the Min-min algorithm leaves room for improvement because of its haste to reduce completion time by overlooking the impact of load balance. Our new algorithm retains the advantages of the Min-min algorithm and balances the load very well. It demonstrates the ability to generate good mapping in various heterogeneous environments

Published in:

Parallel and Distributed Processing Symposium., Proceedings 15th International

Date of Conference:

Apr 2001