An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications

  • Authors:

  • Evripidis Bampis;Rodolphe Giroudeau;Jean-Claude König

  • Affiliations:

  • Laboratoire de Méthodes Informatiques (LaMI), Université d' Évry Val d'Essonne, UMR 8042 CNRS, 523, Place des Terrasses, Immeuble ÉVRY-II, 91000 EVRY, France;Laboratoire de Méthodes Informatiques (LaMI), Université d' Évry Val d'Essonne, UMR 8042 CNRS, 523, Place des Terrasses, Immeuble ÉVRY-II, 91000 EVRY, France;Université de Montpellier II, UMR 5506 CNRS, 161 rue Ada, 34392 Montpellier Cedex 5, France

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2003

Quantified Score

Hi-index 5.26

Visualization

Abstract

We study the problem of minimizing the makespan for the precedence multiprocessor constrained scheduling problem with hierarchical communications (Parallel Process. Lett. 10(1) (2000) 133). We propose an 8/5-approximation algorithm for the Unit Communication Time hierarchical problem with arbitrary but integer processing times and an unbounded number of biprocessor machines. We extend this result in the case where each cluster has m processors (where m is a fixed constant) by presenting a (2 - 2/(2m + 1))-approximation algorithm.