On-line scheduling of multi-core processor tasks with virtualization

Authors:
Deshi Ye;Guochuan Zhang
Affiliations:
College of Computer Science, Zhejiang University, Hangzhou 310027, China;College of Computer Science, Zhejiang University, Hangzhou 310027, China
Venue:
Operations Research Letters
Year:
2010

Citing 17
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
On the performance of on-line algorithms for partition problems

Acta Cybernetica
Dynamic scheduling on parallel machines

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
CM-5E, KSR2, Paragon XP/S: a comparative description of massively parallel computers

Parallel Computing
Bandwidth Allocation with Preemption

SIAM Journal on Computing
On-line scheduling of parallel jobs with runtime restrictions

Theoretical Computer Science
On an on-line scheduling problem for parallel jobs

Information Processing Letters
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing
Optimal Processor Assignment for a Class of Pipelined Computations

IEEE Transactions on Parallel and Distributed Systems
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Scheduling parallel jobs to minimize the makespan

Journal of Scheduling
A case for high performance computing with virtual machines

Proceedings of the 20th annual international conference on Supercomputing
On-line scheduling of parallel jobs in a list

Journal of Scheduling
On-line scheduling of parallel jobs on two machines

Journal of Discrete Algorithms
Online algorithm for parallel job scheduling and strip packing

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Online scheduling of parallel jobs on two machines is 2-competitive

Operations Research Letters
Online strip packing with modifiable boxes

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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 m, where m is the number of processors. Better on-line algorithms are presented for a small number of processors.