loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05)
Adapting a Partitioning-Based Heuristic Load-Balancing Algorithm to Heterogeneous Computing Environments
Timisoara, Romania
September 25-September 29
ISBN: 0-7695-2453-2
Dana Petcu, Western University of Timişoara
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.
Citation:
Dana Petcu, "Adapting a Partitioning-Based Heuristic Load-Balancing Algorithm to Heterogeneous Computing Environments," synasc, pp.170-173, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.