The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
3.5-D Blocking Optimization for Stencil Computations on Modern CPUs and GPUs
Abstract
Stencil computation sweeps over a spatial grid over multiple time steps to perform nearest-neighbor computations. The bandwidth-to-compute requirement for a large class of stencil kernels is very high, and their performance is bound by the available memory bandwidth. Since memory bandwidth grows slower than compute, the performance of stencil kernels will not scale with increasing compute density. We present a novel 3.5D-blocking algorithm that performs 2.5D-spatial and temporal blocking of the input grid into on-chip memory for both CPUs and GPUs. The resultant algorithm is amenable to both thread- level and data-level parallelism, and scales near-linearly with the SIMD width and multiple-cores. Our performance numbers are faster or comparable to state-of-the-art-stencil implementations on CPUs and GPUs. Our implementation of 7-point-stencil is 1.5X-faster on CPUs, and 1.8X faster on GPUs for single- precision floating point inputs than previously reported numbers. For Lattice Boltzmann methods, the corresponding speedup number on CPUs is 2.1X.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adaptive mesh refinement for hyperbolic partial differential equations
Berger, M. J., & Oliger, J. (1984) · Journal of Computational Physics · doi:10.1016/0021-9991(84)90073-1 · Cited by 2,106
Synthesis and evaluation of linear motion transitions
Wang, J., & Bodenheimer, B. (2008) · ACM Transactions on Graphics · doi:10.1145/1330511.1330512 · Cited by 1,534
Adaptive Mesh Refinement for Hyperbolic Partial Differential Equations
Berger, M. J., & Oliger, J. (1983) · doi:10.21236/ada130162 · Cited by 1,523
Larrabee: a many-core x86 architecture for visual computing
Seiler, L., Carmean, D., Sprangle, E., Forsyth, T., Abrash, M., Dubey, P., Junkins, S., Lake, A., Sugerman, J., Cavin, R., et al. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360617 · Cited by 771
Self-citation3D finite difference computation on GPUs using CUDA
Micikevicius, P. (2009) · Proceedings of 2nd Workshop on General Purpose Processing on Graphics Processing Units · doi:10.1145/1513895.1513905 · Cited by 520
Bleck, R., Rooth, C., Hu, D., & Smith, L. T. (1992) · Journal of Physical Oceanography · doi:10.1175/1520-0485(1992)022<1486:sdttia>2.0.co;2 · Cited by 500
Stencil computation optimization and auto-tuning on state-of-the-art multicore architectures
Datta, K., Murphy, M., Volkov, V. M., Williams, S., Carter, J. T., Oliker, L., Patterson, D. A., Shalf, J. M., & Yelick, K. (2008) · IEEE International Conference on High Performance Computing, Data, and Analytics · doi:10.5555/1413370.1413375 · Cited by 462
Stencil computation optimization and auto-tuning on state-of-the-art multicore architectures
Datta, K., Murphy, M., Volkov, V., Williams, S., Carter, J., Oliker, L., Patterson, D., Shalf, J., & Yelick, K. (2008) · 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2008.5222004 · Cited by 281
Tölke, J. (2008) · Computing and Visualization in Science · doi:10.1007/s00791-008-0120-2 · Cited by 245
Optimization and Performance Modeling of Stencil Computations on Modern Microprocessors
Datta, K., Kamil, S., Williams, S., Oliker, L., Shalf, J., & Yelick, K. (2009) · SIAM Review · doi:10.1137/070693199 · Cited by 217
Cited by
(2013) · doi:10.1145/2491956.2462176 · Cited by 885
Ragan-Kelley, J., Barnes, C., Adams, A., Paris, S., Durand, F., & Amarasinghe, S. (2013) · ACM SIGPLAN Notices · doi:10.1145/2499370.2462176 · Cited by 513
Metadata
- Authors
- Nguyen, A., Satish, N., Chhugani, J., Kim, C., & Dubey, P.
- Venue
- 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
- Publisher
- IEEE
- Published
- 2010-11
- Pages
- 1-13
- OpenAlex
- W2039378765
- Cited by
- 290
- References
- 24
- FWCI
- 11.48
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.