[mpich-discuss] how to design a efficient distributed load balance algorithm

[Xiao Li]

Hi MPICH2 people,

Suppose I have N jobs and M machines. Each job needs T_i time to finish.
Now, the problem is I want an algorithm that quickly dispatch N jobs to M
machines in the constrain that the slowest machine's completion time is
minimal. Formally speaking, I need a function f:N->M that mapping N jobs to
M machines with constrain *\argmin_f \max_j \sum_{f(i)=j}{T_i}. *Would anybody
give me some tips for this algorithm?

cheers
Xiao
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.mcs.anl.gov/pipermail/mpich-discuss/attachments/20110104/dcf12f74/attachment.htm>