Maximizing the GPU resource usage by reordering concurrent kernels submission. (17th January 2018)

• Record Type: Journal Article
• Authors: Cruz, Rommel A.Q.; Bentes, Cristiana; Breder, Bernardo; Vasconcellos, Eduardo; Clua, Esteban; de Carvalho, Pablo M.C.; Drummond, Lúcia M.A.
• Other Names: Boeres Cristina guestEditor.; Bentes Cristiana guestEditor.; Moreno Edward guestEditor.; De Rose Cesar A. F. guestEditor.; Castrol Márcio guestEditor.
• Is Part Of: Concurrency and computation. Volume 31:Number 18(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2018-01-17
• Subjects: graphics processing unit -- kernel scheduling -- multiprogramming; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4409
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: The increasing amount of resources available on current GPUs sparked new interest in the problem of sharing its resources by different kernels. While new generations of GPUs support concurrent kernel execution, their scheduling decisions are taken by the hardware at runtime. The hardware decisions, however, heavily depend on the order at which the kernels are submitted to execution. In this work, we propose a novel optimization approach to reorder the kernels invocation focusing on maximizing the resources utilization, improving the average turnaround time. We model the kernel assignments to the hardware resources as a series of knapsack problems and use a dynamic programming approach to solve them. We evaluate our method using kernels with different sizes and resource requirements. Our results show significant gains in the average turnaround time and system throughput compared to the kernels submission implemented in modern GPUs.