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

Nonpreemptive scheduling of independent tasks with prespecified processor allocations

โœ Scribed by L. Bianco; P. Dell'Olmo; M. Grazia Speranza

Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
825 KB
Volume
41
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimizing total completion time in two-
Minimizing total completion time in two-processor task systems with prespecified processor allocations
โœ Xiaoqiang Cai; Chung-Yee Lee; Chung-Lun Li ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 127 KB

We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) tim

On-line scheduling of multi-core process
On-line scheduling of multi-core processor tasks with virtualization
โœ Deshi Ye; Guochuan Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 580 KB

We consider an on-line list scheduling problem of multi-core processor tasks with virtualization to minimize makespan. The competitive ratio of an on-line algorithm is shown for every specific m, where m is the number of processors. Better on-line algorithms are presented for a small number of proce