Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications

Authors:
Evripidis Bampis;Rodolphe Giroudeau;Jean-Claude König
Affiliations:
-;-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 1
Cited 1

Using duplication for scheduling unitary tasks on m processors with unit communication delays

Theoretical Computer Science

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

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a two-step algorithm that efficiently constructs a schedule of minimum makespan for the precedence multiprocessor constrained scheduling problem in the presence of hierarchical communications and task duplication for UET-UCT graphs.