Complexity and approximation for the precedence constrained scheduling problem with large communication delays

Authors:
R. Giroudeau;J. C. König;F. K. Moulaï;J. Palaysi
Affiliations:
LIRMM, UMR, Montpellier Cedex 5, France;LIRMM, UMR, Montpellier Cedex 5, France;LIRMM, UMR, Montpellier Cedex 5, France;LIRMM, UMR, Montpellier Cedex 5, France
Venue:
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Year:
2005

Citing 4
Cited 1

UET scheduling with unit interprocessor communication delays

Discrete Applied Mathematics
New complexity results on scheduling with small communication delays

Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Approximation of algorithms for scheduling trees with general communication delays

Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Complexity and approximation for precedence constrained scheduling problems with large communication delays

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of minimizing the makespan for the multiprocessor scheduling problem. We show that there is no hope of finding a ρ-approximation with $\displaystyle \rho c denotes the communication delay between two tasks i and j submitted to a precedence constraint and to be processed by two different machines. The problem becomes polynomial whenever the makespan is at the most (c+1). The (c+2) case is still partially opened.