Optimizing GPU programs by partial evaluation

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

While GPU utilization allows one to speed up computations to the orders of magnitude, memory management remains the bottleneck making it often a challenge to achieve the desired performance. Hence, different memory optimizations are leveraged to make memory being used more effectively. We propose an approach automating memory management utilizing partial evaluation, a program transformation technique that enables data accesses to be pre-computed, optimized, and embedded into the code, saving memory transactions. An empirical evaluation of our approach shows that the transformed program could be up to 8 times as efficient as the original one in the case of CUDA C naïve string pattern matching algorithm implementation.

Author supplied keywords

Cite

CITATION STYLE

APA

Tyurin, A., Berezun, D., & Grigorev, S. (2020). Optimizing GPU programs by partial evaluation. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP (pp. 431–432). Association for Computing Machinery. https://doi.org/10.1145/3332466.3374507

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free