By Topic

Adapting a partitioning-based heuristic load-balancing algorithm to heterogeneous computing environments

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

1 Author(s)
D. Petcu ; Dept. of Comput. Sci., Western Univ. of Timisoara, Romania

A graph partitioning-based heuristic load-balancing algorithm known as the largest-task-first-with-minimum-finish-time-and-available-communication-costs from EVAH package by M.J. Djomehri, et. al. (2003) is modified in order to be dynamically adapted to heterogeneous computing environments like a grid. An example is given to show the improvement.

Published in:

Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05)

Date of Conference:

25-29 Sept. 2005