Name
Abstract | ||
|---|---|---|
Contemporary GPUs allow concurrent execution of small computational kernels in order to prevent idling of GPU resources. Despite the potential concurrency between independent kernels, the order in which kernels are issued to the GPU will significantly influence the application performance. A technique for deriving suitable kernel launch orders is therefore presented, with the aim of reducing the total execution time. Experimental results indicate that the proposed method yields solutions that are well above the 90 percentile mark in the design space of all possible permutations of the kernel launch sequences. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Kernel (linear algebra),Design space,Concurrency,Computer science,CUDA,Permutation,Parallel computing,Real-time computing,Execution time,Percentile |
DocType | Volume | Citations |
Journal | abs/1511.07983 | 1 |
PageRank | References | Authors |
0.35 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Teng Li | 1 | 53 | 5.40 |
| Vikram K. Narayana | 2 | 102 | 13.18 |
| Tarek El-Ghazawi | 3 | 427 | 44.88 |