A (2+ε)-approximation for scheduling parallel jobs in platforms

  • Authors:

  • Pierre-François Dutot;Klaus Jansen;Christina Robenek;Denis Trystram

  • Affiliations:

  • LIG, Grenoble Institute of Technology INPG, Montbonnot St. Martin, France;Department of Computer Science, University of Kiel, Kiel, Germany;Department of Computer Science, University of Kiel, Kiel, Germany;LIG, Grenoble Institute of Technology INPG, Montbonnot St. Martin, France

  • Venue:
  • Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of Scheduling parallel Jobs in heterogeneous Platforms: We are given a set $\mathcal{J}=\{1,\ldots,n\}$ of n jobs, where a job $j\in\mathcal{J}$ is described by a pair (pj,qj) of a processing time pj∈ℚ0 and the number of processors required qj∈ℕ. We are also given a set $\mathcal{B}$ of N heterogeneous platforms P1,…,PN, where each Pi contains mi processors for i∈{1,…, N}. The objective is to find a schedule for the jobs in the platforms minimizing the makespan. Unless $\mathcal{P}=\mathcal{NP}$ there is no approximation algorithm with absolute ratio strictly better than 2 for the problem. We give a (2+ε)-approximation for the problem improving the previously best known approximation ratio.