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

DOI10.1016/j.orl.2010.04.002zbMath1193.90119MaRDI QIDQ991470

Deshi Ye, Guo-Chuan Zhang

Publication date: 7 September 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2010.04.002

zbMATH Keywords

on-line algorithm; multi-core; virtualization

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling parallel jobs to minimize the makespan
• Online scheduling of parallel jobs on two machines is 2-competitive
• On-line scheduling of parallel jobs in a list
• On-line scheduling of parallel jobs on two machines
• A note on online strip packing
• Online algorithms. The state of the art
• Lower bounds for on-line two-dimensional packing algorithms
• Dynamic scheduling on parallel machines
• Optimal on-line scheduling of parallel jobs with dependencies
• On-line scheduling revisited
• On an on-line scheduling problem for parallel jobs
• Bandwidth Allocation with Preemption
• Algorithms and Computation
• Online Algorithm for Parallel Job Scheduling and Strip Packing
• Bounds for Certain Multiprocessing Anomalies
• Online strip packing with modifiable boxes
• On-line scheduling of parallel jobs with runtime restrictions