𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bound on the number of processors for scheduling with interprocessor communication delays

✍ Scribed by Aziz Moukrim

Publisher
Springer
Year
2000
Tongue
English
Weight
185 KB
Volume
52
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.