✦ LIBER ✦

Multiprocessor scheduling with communication delays

✍ Scribed by B Veltman; B.J Lageweg; J.K Lenstra

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 761 KB
Volume: 16
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(90)90056-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multiprocessor scheduling with interproc

Multiprocessor scheduling with interprocessor communication delays

✍ Chung-Yee Lee; Jing-Jang Hwang; Yuan-Chieh Chow; Frank D. Anger 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 659 KB

Tree scheduling with communication delay

Tree scheduling with communication delays

✍ Philippe Chretienne 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 828 KB

Task scheduling with interprocessor comm

Task scheduling with interprocessor communication delays

✍ Philippe Chrétienne 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 396 KB

UET scheduling with unit interprocessor

UET scheduling with unit interprocessor communication delays

✍ V.J. Rayward-Smith 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 894 KB

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

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