An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications

Authors:
Evripidis Bampis;Rodolphe Giroudeau;Jean-Claude König
Affiliations:
-;-;-
Venue:
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2000

Citing 2
Cited 1

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

Computers and Intractability: A Guide to the Theory of NP-Completeness
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing

Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of minimizing the makespan for the precedence multiprocessor constrained scheduling problem with hierarchical communications [1]. We propose an 8/5 -approximation algorithm for the UET-UCT (Unit Execution Time Unit Communication Time) hierarchical problem with an unbounded number of biprocessor machines. Moreover, we extend this result in the case where each cluster has m processors (where m is a fixed constant) by presenting an ρ-approximation algorithm where ρ = (2 -2/2m +1).