The Community for Technology Leaders
Green Image
Issue No. 05 - Sep./Oct. (2018 vol. 20)
ISSN: 1521-9615
pp: 63-76
Yanhua Wang , Northeastern University, Shenyang, China
Jianzhong Qiao , Northeastern University, Shenyang, China
Shukuan Lin , Northeastern University, Shenyang, China
Tinglei Zhao , Northeastern University, Shenyang, China
ABSTRACT
One of the hot topics in graphic processing unit (GPU) research is workload scheduling. For parallel workloads with a large scale, the scheduling strategy can seriously affect system performance. To address this, the authors carry out scheduling of data transfer before workload execution scheduling, and propose an optimal scheduling algorithm for GPU workload. By hiding data transfer in workload execution to the maximum extent, the algorithm can reduce wait time, thus achieving a small timespan. They attribute the problem of hiding data transfer in workload execution to the 0-1 knapsack problem, and propose the pseudo-polynomial time algorithm based on the Dyer-Zemel algorithm. The authors then deduce the fully polynomial-time algorithm scheme for PPTA. By testing on cloud platform equipped with Nvidia Geforce GTX 750, they show that their scheduling algorithm estimates the optimal schedule sequence effectively.
INDEX TERMS
Data transfer, Graphics processing units, Optimal scheduling, Optimal matching, Scheduling algorithms
CITATION

Y. Wang, J. Qiao, S. Lin and T. Zhao, "An Approximate Optimal Solution to GPU Workload Scheduling," in Computing in Science & Engineering, vol. 20, no. 5, pp. 63-76, 2018.
doi:10.1109/MCSE.2018.110145709
299 ms
(Ver 3.3 (11022016))