.png){kind=icon}
Return
Efficient multicore-aware parallelization strategies for iterative stencil computations
.png){kind=icon}
OA
AI
DOI：10.1016/j.jocs.2011.01.010.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Stencil computations consume a major part of runtime in many scientific simulation codes. As prototypes for this class of algorithms we consider the iterative Jacobi and Gauss-Seidel smoothers and aim at highly efficient parallel implementations for cache-based multicore architectures. Temporal cache blocking is a known advanced optimization technique, which can reduce the pressure on the memory bus significantly. We apply and refine this optimization for a recently presented temporal blocking strategy designed to explicitly utilize multicore characteristics. Especially for the case of Gauss-Seidel smoothers we show that simultaneous multi-threading (SMT) can yield substantial performance improvements for our optimized algorithm on some architectures. (C) 2011 Elsevier B.V. All rights reserved.
Keywords:
Stencil computations
Spatial blocking
Temporal blocking
Wavefront parallelization
Multicore
Simultaneous multi-threading
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
18.3
Papers:
3.1K
Citations:
4.0K
Organization
.png){kind=icon}
