Graphics Processing Units (GPUs) have become the standard in accelerating scientific applications on heterogeneous systems. However, as GPUs are getting faster, one potential performance bottleneck with GPU-accelerated applications is the overhead from launching several fine-grained kernels. CUDA Graph addresses these performance challenges by enabling a graph-based execution model that captures operations as nodes and dependence as edges in a static graph. Thereby consolidating several kernel launches into one graph launch. We propose a performance optimization strategy for iteratively launched kernels. By grouping kernel launches into iteration batches and then unrolling these batches into a CUDA Graph, iterative applications can benefit from CUDA Graph for performance boosting. We analyze the performance gain and overhead from this approach by designing a skeleton application. The skeleton application also serves as a generalized example of converting an iterative solver to CUDA Graph, and for deriving a performance model. Using the skeleton application, we show that when unrolling iteration batches for a given platform, there is an optimal size of the iteration batch, which is independent of workload, balancing the extra overhead from graph creation with the performance gain of the graph execution. Depending on workload, we show that the optimal iteration batch size gives more than 1.4x speed-up in the skeleton application. Furthermore, we show that similar speed-up can be gained in Hotspot and Hotspot3D from the Rodinia benchmark suite and a Finite-Difference Time-Domain (FDTD) Maxwell solver.
RAFI -- A Ray/Work Forwarding Infrastructure for Data Parallel Multi-Node/Multi-GPU Computing
NVIDIA(英伟达);Bilkent University(比尔肯特大学);SCI Institute, University of Utah(犹他大学计算研究所);University of Cologne(科隆大学);NASA Ames Research Center(NASA艾姆斯研究中心);IT4Innovations, VSB -Technical University of Ostrava(Ostrava理工大学IT4创新中心)
Simulation of 1+1 dimensional surface growth and lattices gases using GPUs
限制固体表面生长模型可以映射到二元晶格气体。我们表明,有效的模拟算法可以实现GPU上的CUDA或OpenCL编程。我们考虑了与非对称简单排除过程相关的1+1维Kardar-Parisi-Zhang生长的沉积/蒸发模型,并表明对于适合GPU共享内存的大小,可以实现最大并行化加速比(对于Quadro FX 5800显卡,相对于2.67 GHz的单个CPU)。这使我们能够研究淬火柱状无序的影响,需要非常长的模拟时间。我们比较CUDA实现OpenCL实现设计的处理器集群通过MPI。实现了一个具有随机转向点的双车道交通模型,并研究了该模型的动力学行为。