Online scheduling of mixed CPU-GPU jobs

Lin Chen, Deshi Ye, Guochuan Zhang

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


We consider the online scheduling problem in a CPU-GPU cluster. In this problem there are two sets of processors, the CPU processors and the GPU processors. Each job has two distinct processing times, one for the CPU processor and the other for the GPU processor. Once a job is released, a decision should be made immediately about which processor it should be assigned to. The goal is to minimize the makespan, i.e., the largest completion time among all the processors. Such a problem could be seen as an intermediate model between the scheduling problem on identical machines and unrelated machines. We provide a 3.85-competitive online algorithm for this problem and show that no online algorithm exists with competitive ratio strictly less than 2. We also consider two special cases of this problem, the balanced case where the number of CPU processors equals to that of GPU processors, and the one-sided case where there is only one CPU or GPU processor. For the balanced case, we first provide a simple 3-competitive algorithm, and then a better algorithm with competitive ratio of 2.732 is derived. For the one-sided case, a 3-competitive algorithm is given.

Original languageEnglish
Pages (from-to)745-761
Number of pages17
JournalInternational Journal of Foundations of Computer Science
Issue number6
StatePublished - Nov 8 2014


  • CPU-GPU cluster
  • Competitive ratio
  • Online scheduling
  • Unrelated machine scheduling


Dive into the research topics of 'Online scheduling of mixed CPU-GPU jobs'. Together they form a unique fingerprint.

Cite this