Data layout optimization for GPGPU architectures

Jun Liu, Wei Ding, Ohyoung Jang, Mahmut Kandemir

Research output: Contribution to journalArticle

Abstract

GPUs are being widely used in accelerating general-purpose applications, leading to the emergence of GPGPU architectures. New programming models, e.g., Compute Unified Device Architecture (CUDA), have been proposed to facilitate programming general-purpose computations in GPGPUs. However, writing highperformance CUDA codes manually is still tedious and difficult. In particular, the organization of the data in the memory space can greatly affect the performance due to the unique features of a custom GPGPU memory hierarchy. In this work, we propose an automatic data layout transformation framework to solve the key issues associated with a GPGPU memory hierarchy (i.e., channel skewing, data coalescing, and bank conflicts). Our approach employs a widely applicable strategy based on a novel concept called data localization. Specifically, we try to optimize the layout of the arrays accessed in affine loop nests, for both the device memory and shared memory, at both coarse grain and fine grain parallelization levels. We performed an experimental evaluation of our data layout optimization strategy using 15 benchmarks on an NVIDIA CUDA GPU device. The results show that the proposed data transformation approach brings around 4.3X speedup on average.

Original languageEnglish (US)
Pages (from-to)283-284
Number of pages2
JournalACM SIGPLAN Notices
Volume48
Issue number8
DOIs
Publication statusPublished - Aug 1 2013

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this