Date Added: Jun 2009
This paper introduces techniques in scheduling jobs on a master/workers platform where the bandwidth is shared by all workers. The jobs are independent and each job requires a fixed amount of bandwidth to download input data before execution. The master can communicate with multiple workers simultaneously, provided that the bandwidth used by the master and the workers do not exceed their bandwidth limits. The authors proposed two models for this limited-bandwidth problem. If the data transfer cannot be interrupted, then they prove that the scheduling problem is NP-complete.