One of the subproblems is: for any given processor, choose the subset of boxes whose total number of cells comes closer to some number (the load to be transfered from this processor to another one), this is a non-trivial (probably NP-complete) Knapsack problem.
See GfsEventBalance for the completed implementation.
Jason K. Johnson, Danny Bickson, Danny Dolev - Fixing Convergence of Gaussian Belief Propagation
- CoRR abs/0901.4192, 2009
Boillat, JE - Load balancing and poisson equation in a graph
- Concurrency: Practice and Experience 2(4), 1990
Hu, YF, Blake, RJ, Emerson, DR - An optimal migration algorithm for dynamic load balancing
- Concurrency: Practice and Experience 10(6), 1998