skip to main content
poster

POSTER: MAPA: An Automatic Memory Access Pattern Analyzer for GPU Applications

Published:26 January 2017Publication History
Skip Abstract Section

Abstract

Various existing optimization and memory consistency management techniques for GPU applications rely on memory access patterns of kernels. However, they suffer from poor practicality because they require explicit user interventions to extract kernel memory access patterns. This paper proposes an automatic memory-access-pattern analysis framework called MAPA. MAPA is based on a source-level analysis technique derived from traditional symbolic analyses and a run-time pattern selection technique. The experimental results show that MAPA properly analyzes 116 real-world OpenCL kernels from Rodinia and Parboil.

References

  1. R. A. Ballance, A. B. Maccabe, and K. J. Ottenstein. The program dependence web: A representation supporting control-, data-, and demand-driven interpretation of imperative languages. In phProceedings of the ACM SIGPLAN 1990 Conference on Programming Language Design and Implementation, pages 257--271, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Bauer, H. Cook, and B. Khailany. CudaDMA: Optimizing GPU memory bandwidth via warp specialization. In phProceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Che, J. W. Sheaffer, and K. Skadron. Dymaxion: Optimizing memory access patterns for heterogeneous systems. In phProceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. R. Haghighat and C. D. Polychronopoulos. Symbolic analysis for parallelizing compilers. In phACM Transactions on Programming Languages and Systems, volume 18, pages 477--518, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. B.-N. Tal, E. Levy, A. Barak, and E. Rubin. Memory access patterns: The missing piece of the multi-GPU puzzle. In phProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. P. Tu and D. Padua. Gated SSA-based demand-driven symbolic analysis for parallelizing compilers. In phProceedings of the 9th International Conference on Supercomputing, pages 414--423, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. POSTER: MAPA: An Automatic Memory Access Pattern Analyzer for GPU Applications

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Article Metrics

        • Downloads (Last 12 months)9
        • Downloads (Last 6 weeks)1

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!