𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling trees with large communication delays on two identical processors

✍ Scribed by F. Afrati; E. Bampis; L. Finta; I. Milis

Publisher
Springer US
Year
2005
Tongue
English
Weight
638 KB
Volume
8
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Sensitivity analysis of tree scheduling
Sensitivity analysis of tree scheduling on two machines with communication delays
✍ FrΓ©dΓ©ric Guinand; Aziz Moukrim; Eric Sanlaville πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 282 KB

This paper presents a sensitivity analysis for the problem of scheduling trees with communication delays on two identical processors, to minimize the makespan. Tasks are supposed to have unit execution time (UET UET), and the values associated to communication delays are supposed unknown before the