Scheduling parallel jobs on heterogeneous platforms

https://doi.org/10.1016/j.endm.2016.10.003Get rights and content

Abstract

We consider the problem of scheduling parallel jobs on heterogeneous platforms. Given a set J of n jobs where each job jJ is described by a pair (pj, qj) with a processing time pj and number qj of processors required and a set of N heterogeneous platforms Pi with mi processors, the goal is to find a schedule for all jobs on the platforms minimizing the maximum completion time. The problem is directly related to a two-dimensional multi strip packing problem. Unless P=NP there is no approximation algorithm with absolute ratio better than 2 for the problem. We propose an approximation algorithm with absolute ratio 2 improving the previously best known approximation algorithms. This closes the gap between the lower bound of <2 and the best approximation ratio.

References (8)

  • J. Remy

    Resource constrained scheduling on multiple machines

    Information Processing Letters

    (2004)
  • M. Bougeret, P.-F. Dutot, K. Jansen, C. Otte, D. Trystram, A fast 5/2-approximation algorithm for hierarchical...
  • P.F. Dutot, K. Jansen, C. Robenek, D. Trystram, A (2+ϵ) – approximation for scheduling parallel jobs in platforms, in:...
  • K. Jansen et al.

    Scheduling parallel jobs on a network of heterogeneous platforms

    (2015)
There are more references available in the full text version of this article.
1

Research supported by German Research Foundation (DFG), project Ja 612/12-2.

View full text