Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1002/cpe.4409 | CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE |
Keywords | DocType | Volume |
graphics processing unit,kernel scheduling,multiprogramming | Journal | 31.0 |
Issue | ISSN | Citations |
SP18.0 | 1532-0626 | 4 |
PageRank | References | Authors |
0.50 | 0 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rommel Anatoli Quintanilla Cruz | 1 | 4 | 0.50 |
| Cristiana Bentes | 2 | 60 | 17.06 |
| Bernardo B. Labronici | 3 | 4 | 0.50 |
| Eduardo C. Vasconcellos | 4 | 4 | 0.50 |
| Esteban W. Gonzalez Clua | 5 | 279 | 53.69 |
| Pablo Carvalho | 6 | 7 | 1.63 |
| Lúcia Maria de A. Drummond | 7 | 4 | 0.50 |