Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms

  title={Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms},
  author={Riley Murray and Megan Chao and Samir Khuller},
The Map-Reduce computing framework rose to prominence with datasets of such size that dozens of machines on a single cluster were needed for individual jobs. As datasets approach the exabyte scale, a single job may need distributed processing not only on multiple machines, but on multiple clusters. We consider a scheduling problem to minimize weighted average completion time of n jobs on m distributed clusters of parallel machines. In keeping with the scale of the problems motivating this work… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 3 times over the past 90 days. VIEW TWEETS
2 Citations
15 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 15 references

From linear programming relaxations to approximation algorithms for scheduling problems : A tour d

  • Andreas S Schulz
  • horizon. Working paper; available upon request.,
  • 2012

Hall . Supply chain scheduling : Assembly systems

  • Zhi-Long Chen, G. Nicholas
  • Automata , Languages and Programming
  • 2010

doi:10.1016/j.orl.2010.04.011. 11 Microsoft

  • Riley Murray, Megan Chao, Samir Khuller
  • Research Letters,
  • 2010

Openshops with jobs overlap

  • C. Sriskandarajah, E. Wagneur
  • Europ J Oper Res
  • 1993

Similar Papers

Loading similar papers…