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

On-line scheduling of parallel jobs in a list

โœ Scribed by Deshi Ye; Guochuan Zhang

Book ID
106429546
Publisher
Springer US
Year
2007
Tongue
English
Weight
327 KB
Volume
10
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Randomized On-line Scheduling of Paralle
Randomized On-line Scheduling of Parallel Jobs
โœ Jiล™ฤฑ́ Sgall ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 230 KB

We study randomized on-line scheduling on mesh machines. We show that for scheduling independent jobs randomized algorithms can achieve a significantly better performance than deterministic ones; on the other hand with dependencies randomization does not help.

On an on-line scheduling problem for par
On an on-line scheduling problem for parallel jobs
โœ Edwin Naroska; Uwe Schwiegelshohn ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 101 KB

This paper addresses the non-preemptive on-line scheduling of parallel jobs. In particular we assume that the release dates and the processing times of the jobs are unknown. It is already known that for this problem Garey and Graham's list scheduling algorithm achieves the competitive factor 2 -1 m