An Approximation Algorithm for Scheduling Dependent Tasks on M Processors With Small Communication Delays (1995)
| Citations: | 12 - 0 self |
BibTeX
@MISC{Hanen95anapproximation,
author = {C. Hanen and A. Munier and C. Hanen A. Munier and Universit'e P. Et M. Curie},
title = {An Approximation Algorithm for Scheduling Dependent Tasks on M Processors With Small Communication Delays},
year = {1995}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper defines and studies an approximation algorithm for scheduling tasks with small communication delays on m processors. In a first step, a schedule oe 1 for the problem instance with an unlimited number of processors is generated with a polynomial algorithm with relative performance bounded by 2(1 + ae) 2 + ae , where ae denotes the ratio between the greatest communication delay and the smallest processing time. Then this solution is used to solve the resource conflicts during the scheduling phase on m processors, with a rather unusual feature: a processor may remain idle even if some tasks are feasible in order to wait for a more important task. The schedule generated by this algorithm is proved to have an overall worst case performance 4 + 3ae 2 + ae \Gamma 2 + 2ae (2 + ae)m , improving the best known ratio 2 + ae \Gamma 2 m . Keywords : scheduling, makespan, communication delays. AMS subject classification : 68M20. 1 1 Introduction With the recen...
