The reviewed record of science sign in
Pith

arxiv: 2303.12374 · v1 · pith:ZAGSUW45 · submitted 2023-03-22 · cs.DC

Kernel Launcher: C++ Library for Optimal-Performance Portable CUDA Applications

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:ZAGSUW45record.jsonopen to challenge →

classification cs.DC
keywords kernelapplicationslauncherkernelstuningauto-tuningbackcode
0
0 comments X
read the original abstract

Graphic Processing Units (GPUs) have become ubiquitous in scientific computing. However, writing efficient GPU kernels can be challenging due to the need for careful code tuning. To automatically explore the kernel optimization space, several auto-tuning tools - like Kernel Tuner - have been proposed. Unfortunately, these existing auto-tuning tools often do not concern themselves with integration of tuning results back into applications, which puts a significant implementation and maintenance burden on application developers. In this work, we present Kernel Launcher: an easy-to-use C++ library that simplifies the creation of highly-tuned CUDA applications. With Kernel Launcher, programmers can capture kernel launches, tune the captured kernels for different setups, and integrate the tuning results back into applications using runtime compilation. To showcase the applicability of Kernel Launcher, we consider a real-world computational fluid dynamics code and tune its kernels for different GPUs, input domains, and precisions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Record-Remix-Replay: Hierarchical GPU Kernel Optimization using Evolutionary Search

    cs.DC 2026-04 unverdicted novelty 6.0

    R^3 optimizes full scientific applications on GPUs better than tuning kernel parameters or compiler flags alone while running nearly an order of magnitude faster than modern evolutionary search methods.