๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on scheduling multiprocessor tasks with precedence constraints on parallel processors

โœ Scribed by A.K. Amoura

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
367 KB
Volume
63
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A comparison of heuristics for schedulin
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors
โœ A.K. Amoura; E. Bampis; Y. Manoussakis; Zs. Tuza ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 266 KB

We consider the problem of scheduling a set of independent multiprocessor tasks on three dedicated processors in order to minimize the makespan. We propose a new heuristic, called Divide Uniprocessor Tasks (DUT), and we provide simulation results comparing the eectiveness of DUT with previously know

Using duplication for scheduling unitary
Using duplication for scheduling unitary tasks on m processors with unit communication delays
โœ A. Munier; C. Hanen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 633 KB

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 -l/m and that this bound is tight.