Online Scheduling on a CPU-GPU Cluster

DOI10.1007/978-3-642-38236-9_1zbMath1382.68043OpenAlexW206617434MaRDI QIDQ4922108

Deshi Ye, Lin Chen, Guo-Chuan Zhang

Publication date: 28 May 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38236-9_1

zbMATH Keywords

competitive ratioonline schedulingunrelated machine schedulingCPU-GPU cluster

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• A new algorithm for online uniform-machine scheduling to minimize the makespan
• Machine scheduling with resource dependent processing times
• Scheduling on two identical machines with a speed-up resource
• Improved approximation schemes for scheduling unrelated parallel machines
• A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Bounds for List Schedules on Uniform Processors
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• An On-Line Algorithm for Some Uniform Processor Scheduling
• On-Line Load Balancing for Related Machines
• Scheduling parallel dedicated machines with the speeding‐up resource
• Bounds for Certain Multiprocessing Anomalies