Optimization and Performance Modeling of Stencil Computations on Modern Microprocessors

  • Authors:

  • Kaushik Datta;Shoaib Kamil;Samuel Williams;Leonid Oliker;John Shalf;Katherine Yelick

  • Affiliations:

  • -;-;-;SAKamil@lbl.gov and SWWilliams@lbl.gov and loliker@lbl.gov and JShalf@lbl.gov and KAYelick@lbl.gov;-;-

  • Venue:
  • SIAM Review
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Stencil-based kernels constitute the core of many important scientific applications on block-structured grids. Unfortunately, these codes achieve a low fraction of peak performance, due primarily to the disparity between processor and main memory speeds. In this paper, we explore the impact of trends in memory subsystems on a variety of stencil optimization techniques and develop performance models to analytically guide our optimizations. Our work targets cache reuse methodologies across single and multiple stencil sweeps, examining cache-aware algorithms as well as cache-oblivious techniques on the Intel Itanium2, AMD Opteron, and IBM Power5. Additionally, we consider stencil computations on the heterogeneous multicore design of the Cell processor, a machine with an explicitly managed memory hierarchy. Overall our work represents one of the most extensive analyses of stencil optimizations and performance modeling to date. Results demonstrate that recent trends in memory system organization have reduced the efficacy of traditional cache-blocking optimizations. We also show that a cache-aware implementation is significantly faster than a cache-oblivious approach, while the explicitly managed memory on Cell enables the highest overall efficiency: Cell attains 88% of algorithmic peak while the best competing cache-based processor achieves only 54% of algorithmic peak performance.