An approximation algorithm for scheduling dependent tasks on m processors with small communication delays

Abstract

This paper de nes and studies an approximation algorithm for scheduling tasks with small communication delays onm processors. In a rst step, a schedule 1 for the problem instance with an unlimited number of processors is generated with a polynomial algorithm with relative performance bounded by 2(1 + ) 2 + , where denotes the ratio between the greatest… (More)
DOI: 10.1016/S0166-218X(00)00179-7

Topics

4 Figures and Tables

Cite this paper

@article{Hanen2001AnAA, title={An approximation algorithm for scheduling dependent tasks on m processors with small communication delays}, author={Claire Hanen and Alix Munier Kordon}, journal={Discrete Applied Mathematics}, year={2001}, volume={108}, pages={239-257} }