✦ LIBER ✦

Using duplication for scheduling unitary tasks on m processors with unit communication delays

✍ Scribed by A. Munier; C. Hanen

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 633 KB
Volume: 178
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)88194-7

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

An Optimal Algorithm for Scheduling Inte

An Optimal Algorithm for Scheduling Interval Ordered Tasks with Communication on N Processors

✍ H.H. Ali; H. Elrewini 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 506 KB

The problem of scheduling task graphs on multiprocessor systems have received considerable attention in recent years. This problem is known to be NP-hard in its general form as well as many restricted cases. Few polynomial algorithms have been developed for solving special cases of the scheduling pr