Resource Allocation on Sparse Graphs
Collas, M. · Aston Publications Explorer (Aston University) · 2005
Considering a network of workers represented by a sparse graph where each worker (ie. node) has a specific load of small independent jobs, our aim is to move the jobs around such that all tasks will be carried out while the communication is minimized. We examine the performance of a new algorithm based on message passing methods in comparison with a standard quadratic programming based algorithm.