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

Authors:
Rodolphe Giroudeau;Jean-Claude Konig;Farida Kamila Moulai;Jérôme Palaysi
Affiliations:
LIRMM, Université de Montpellier II, UMR 5506 CNRS, 161 rue Ada, 34392 Montpellier Cedex 5, France;LIRMM, Université de Montpellier II, UMR 5506 CNRS, 161 rue Ada, 34392 Montpellier Cedex 5, France;LIRMM, Université de Montpellier II, UMR 5506 CNRS, 161 rue Ada, 34392 Montpellier Cedex 5, France;LIRMM, Université de Montpellier II, UMR 5506 CNRS, 161 rue Ada, 34392 Montpellier Cedex 5, France
Venue:
Theoretical Computer Science
Year:
2008

Citing 8
Cited 1

UET scheduling with unit interprocessor communication delays

Discrete Applied Mathematics
Towards an architecture-independent analysis of parallel algorithms

SIAM Journal on Computing
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)
Using duplication for scheduling unitary tasks on m processors with unit communication delays

Theoretical Computer Science
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 the precedence constrained scheduling problem with large communication delays

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Three, four, five, six, or the complexity of scheduling with communication delays

Operations Research Letters

On minimizing the resource consumption of cloud applications using process migrations

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

We investigate the problem of minimizing the makespan (resp. the sum of completion time) for the multiprocessor scheduling problem. We show that there is no hope of finding a @r-approximation with @r=2.