17360

A Similarity Measure for GPU Kernel Subgraph Matching

Robert V. Lim, Boyana Norris, Allen D. Malony
Computer and Information Science, University of Oregon, Eugene, OR, USA
arXiv:1707.02423 [cs.DC], (8 Jul 2017)

@article{lim2017similarity,

   title={A Similarity Measure for GPU Kernel Subgraph Matching},

   author={Lim, Robert V. and Norris, Boyana and Malony, Allen D.},

   year={2017},

   month={jul},

   archivePrefix={"arXiv"},

   primaryClass={cs.DC}

}

Download Download (PDF)   View View   Source Source   

144

views

Accelerator architectures specialize in executing SIMD (single instruction, multiple data) in lockstep. Because the majority of CUDA applications are parallelized loops, control flow information can provide an in-depth characterization of a kernel. CUDAflow is a tool that statically separates CUDA binaries into basic block regions and dynamically measures instruction and basic block frequencies. CUDAflow captures this information in a control flow graph (CFG) and performs subgraph matching across various kernel’s CFGs to gain insights to an application’s resource requirements, based on the shape and traversal of the graph, instruction operations executed and registers allocated, among other information. The utility of CUDAflow is demonstrated with SHOC and Rodinia application case studies on a variety of GPU architectures, revealing novel thread divergence characteristics that facilitates end users, autotuners and compilers in generating high performing code.
VN:F [1.9.22_1171]
Rating: 5.0/5 (1 vote cast)
A Similarity Measure for GPU Kernel Subgraph Matching, 5.0 out of 5 based on 1 rating

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: