𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tree scheduling with communication delays

✍ Scribed by Philippe Chretienne

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
828 KB
Volume
49
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Complexity of Scheduling Trees with
The Complexity of Scheduling Trees with Communication Delays
✍ Jan Karel Lenstra; Marinus Veldhorst; Bart Veltman πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 190 KB

We consider the problem of finding a minimum-length schedule on m machines for a set of n unit-length tasks with a forest of intrees as precedence relation, and with unit interprocessor communication delays. First, we prove that this problem is NP-complete; second, we derive a linear time algorithm

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

Approximation algorithms for scheduling
Approximation algorithms for scheduling trees with general communication delays
✍ Alix Munier πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 101 KB

We consider the problem of scheduling a tree with general communication delays. Jakoby and Reischuk proved that this problem is NP-hard for binary trees and unlimited number of processors. Firstly, we develop a clustering procedure based on the same lower bounds as Papadimitriou and Yannakakis for a