✦ LIBER ✦

UET scheduling with unit interprocessor communication delays

✍ Scribed by V.J. Rayward-Smith

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 894 KB
Volume: 18
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90042-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Task scheduling with interprocessor comm

Task scheduling with interprocessor communication delays

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

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

Approximation algorithms for UET schedul

Approximation algorithms for UET scheduling problems with exact delays

✍ Alexander A. Ageev; Alexei E. Baburin 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 167 KB

Multiprocessor scheduling with communica

Multiprocessor scheduling with communication delays

✍ B Veltman; B.J Lageweg; J.K Lenstra 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 761 KB

Tree scheduling with communication delay

Tree scheduling with communication delays

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

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.