✦ LIBER ✦

A linear time algorithm for scheduling outforests with communication delays on three processors

✍ Scribed by Mauro Dell'Amico; Lucian Finta

Book ID: 108421605
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 205 KB
Volume: 44
Category: Article
ISSN: 0196-6774
DOI: 10.1016/s0196-6774(02)00201-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal algorithm for tree scheduling wi

Optimal algorithm for tree scheduling with unit time communication delays

✍ Wajdi, T.; Imitaz, A. 📂 Article 📅 2001 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 255 KB

Scheduling with Duplication on m Process

Scheduling with Duplication on m Processors with Small Communication Delays

✍ A. Goldman; C. Rapine 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Scheduling Tasks with Small Communicatio

Scheduling Tasks with Small Communication Delays for Clusters of Processors

✍ E. Bampis; R. Giroudeau; A. Kononov 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 147 KB

A simple linear time approximation algor

A simple linear time approximation algorithm for multi-processor job scheduling on four processors

✍ Jingui Huang; Jianer Chen; Songqiao Chen; Jianxin Wang 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 602 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.

Upper bound on the number of processors

Upper bound on the number of processors for scheduling with interprocessor communication delays

✍ Aziz Moukrim 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 185 KB