𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of scheduling multiprocessor tasks with prespecified processor allocations

✍ Scribed by J.A. Hoogeveen; S.L. van de Velde; B. Veltman

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
919 KB
Volume
55
Category
Article
ISSN
0166-218X

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

A comparison of heuristics for schedulin
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors
✍ A.K. Amoura; E. Bampis; Y. Manoussakis; Zs. Tuza πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 266 KB

We consider the problem of scheduling a set of independent multiprocessor tasks on three dedicated processors in order to minimize the makespan. We propose a new heuristic, called Divide Uniprocessor Tasks (DUT), and we provide simulation results comparing the eectiveness of DUT with previously know

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