The Community for Technology Leaders
2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2005)
Timisoara, Romania
Sept. 25, 2005 to Sept. 29, 2005
ISBN: 0-7695-2453-2
pp: 170-173
Dana Petcu , Western University of Timişoara
ABSTRACT
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 [3] is modified in order to be dynamically adapted to heterogeneous computing environments like a grid. An example is given to show the improvement.
INDEX TERMS
null
CITATION
Dana Petcu, "Adapting a Partitioning-Based Heuristic Load-Balancing Algorithm to Heterogeneous Computing Environments", 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, vol. 00, no. , pp. 170-173, 2005, doi:10.1109/SYNASC.2005.16
92 ms
(Ver 3.3 (11022016))