𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling with Duplication on m Processors with Small Communication Delays

✍ Scribed by A. Goldman; C. Rapine

Book ID
108497992
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
257 KB
Volume
7
Category
Article
ISSN
1571-0653

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.

Scheduling chains on uniform processors
Scheduling chains on uniform processors with communication delays
✍ Wieslaw Kubiak1; Bernard Penz; Denis Trystram πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 200 KB

We show that the problem of scheduling chains of unit execution time (UET) jobs on uniform processors with communication delays to minimize makespan is NP-hard in the strong sense. We also give a heuristic that generates solutions with known, and relatively small, absolute error for this problem. Th