Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142723 | Operations Research Letters | 2010 | 5 Pages |
Abstract
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 mm, where mm is the number of processors. Better on-line algorithms are presented for a small number of processors.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Deshi Ye, Guochuan Zhang,