Rapport de Recherche Litp /
Litp research reports
14 pages - Octobre/October 1995 - Document en anglais.
PostScript : Ko /Kb
Titre / Title: Using duplication for scheduling unitary tasks on m processors with communication delays
Abstract : This paper introduces a new list scheduling algorithm that uses greedy duplication to solve a scheduling problem with communication delays and resource limitations. We prove that, for any priority list, its worst case relative performance is bounded by 2-1/m and that this bound is tight.
Publications internes Litp 1995 / Litp research reports 1995