๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Scheduling Tasks with Small Communication Delays for Clusters of Processors

โœ Scribed by E. Bampis; R. Giroudeau; A. Kononov

Book ID
111570867
Publisher
Springer US
Year
2004
Tongue
English
Weight
147 KB
Volume
129
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.

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