✦ LIBER ✦

Optimal algorithm for tree scheduling with unit time communication delays

✍ Scribed by Wajdi, T.; Imitaz, A.

Book ID: 114448476
Publisher: The Institution of Electrical Engineers
Year: 2001
Tongue: English
Weight: 255 KB
Volume: 148
Category: Article
ISSN: 1350-2387
DOI: 10.1049/ip-cdt:20010344

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A linear time algorithm for scheduling o

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

✍ Mauro Dell'Amico; Lucian Finta 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Bicriteria approximation algorithms for

Bicriteria approximation algorithms for scheduling problems with communications delays

✍ Evripidis Bampis; Alexander Kononov 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 244 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.

Optimal schedules for d-D grid graphs wi

Optimal schedules for d-D grid graphs with communication delays

✍ E. Bampis; C. Delorme; J.-C. König 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 125 KB

We consider a task graph model taking into account the communication among tasks of a parallel system. First, we assume that the available number of processors is adequate for dealing with the whole width of the task graph (i.e. the number of processors is unbounded), and we propose a scheduling str

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