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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.