The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Stencil computation optimization and auto-tuning on state-of-the-art multicore architectures
Open accessAbstract
Understanding the most efficient design and utilization of emerging multicore systems is one of the most challenging questions faced by the mainstream and scientific computing industries in several decades. Our work explores multicore stencil (nearest-neighbor) computations - a class of algorithms at the heart of many structured grid codes, including PDE solvers. We develop a number of effective optimization strategies, and build an auto-tuning environment that searches over our optimizations and their parameters to minimize runtime, while maximizing performance portability. To evaluate the effectiveness of these strategies we explore the broadest set of multicore architectures in the current HPC literature, including the Intel Clovertown, AMD Barcelona, Sun Victoria Falls, IBM QS22 PowerXCell 8i, and NVIDIA GTX280. Overall, our auto-tuning optimization methodology results in the fastest multicore stencil performance to date. Finally, we present several key insights into the architectural tradeoffs of emerging multicore designs and their implications on scientific algorithm development.
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
Automated empirical optimizations of software and the ATLAS project
Clint Whaley, R., Petitet, A., & Dongarra, J. J. (2001) · Parallel Computing · doi:10.1016/s0167-8191(00)00087-9 · Cited by 1,317
Optimization of sparse matrix-vector multiplication on emerging multicore platforms
Williams, S., Oliker, L., Vuduc, R., Shalf, J., Yelick, K., & Demmel, J. (2007) · Proceedings of the 2007 ACM/IEEE conference on Supercomputing · doi:10.1145/1362622.1362674 · Cited by 791
Self-citationOptimization of sparse matrix–vector multiplication on emerging multicore platforms
Williams, S., Oliker, L., Vuduc, R., Shalf, J., Yelick, K., & Demmel, J. (2009) · Parallel Computing · doi:10.1016/j.parco.2008.12.006 · Cited by 789
Self-citationThe potential of the cell processor for scientific computing
Williams, S., Shalf, J., Oliker, L., Kamil, S., Husbands, P., & Yelick, K. (2006) · Proceedings of the 3rd conference on Computing frontiers · doi:10.1145/1128022.1128027 · Cited by 309
Self-citationBlocking and array contraction across arbitrarily nested loops using affine partitioning
Lim, A. W., Liao, S.-W., & Lam, M. S. (2001) · Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming · doi:10.1145/379539.379586 · Cited by 142
Chip multiprocessing and the cell broadband engine
Gschwind, M. K. (2006) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/1128022.1128023 · Cited by 133
Implicit and explicit optimizations for stencil computations
Kamil, S., Datta, K., Williams, S., Oliker, L., Shalf, J., & Yelick, K. (2006) · Proceedings of the 2006 workshop on Memory system performance and correctness · doi:10.1145/1178597.1178605 · Cited by 130
Self-citationImpact of modern memory subsystems on cache optimizations for stencil computations
Kamil, S. A., Husbands, P., Oliker, L., Shalf, J. M., & Yelick, K. (2005) · Workshop on Memory System Performance and Correctness · doi:10.1145/1111583.1111589 · Cited by 103
Self-citationLattice Boltzmann simulation optimization on leading multicore platforms
Williams, S., Carter, J., Oliker, L., Shalf, J., & Yelick, K. (2008) · 2008 IEEE International Symposium on Parallel and Distributed Processing · doi:10.1109/ipdps.2008.4536295 · Cited by 98
Self-citation
Cited by
3.5-D Blocking Optimization for Stencil Computations on Modern CPUs and GPUs
Nguyen, A., Satish, N., Chhugani, J., Kim, C., & Dubey, P. (2010) · 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2010.2 · Cited by 290
State-of-the-art in Heterogeneous Computing
Brodtkorb, A. R., Dyken, C., Hagen, T. R., Hjelmervik, J. M., & Storaasli, O. O. (2010) · Scientific Programming · doi:10.1155/2010/540159 · Cited by 257
An auto-tuning framework for parallel multicore stencil computations
Kamil, S., Chan, C., Oliker, L., Shalf, J., & Williams, S. (2010) · 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS) · doi:10.1109/ipdps.2010.5470421 · Cited by 209
Self-citation
Metadata
- Authors
- Datta, K., Murphy, M., Volkov, V., Williams, S., Carter, J., Oliker, L., Patterson, D., Shalf, J., & Yelick, K.
- Venue
- 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis
- Publisher
- IEEE
- Published
- 2008-11
- Pages
- 1-12
- ISSN
- 2167-4337 (ISSN-L)
- OpenAlex
- W3152199537
- Cited by
- 281
- References
- 11
- FWCI
- 9.84
- Type
- conference paper
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Stencil computation optimization and auto-tuning on state-of-the-art multicore architectures. https://app.cochat.ai/papers/10.1109/sc.2008.5222004
- The paper
- Datta, K., Murphy, M., Volkov, V., Williams, S., Carter, J., Oliker, L., Patterson, D., Shalf, J., & Yelick, K. (2008). Stencil computation optimization and auto-tuning on state-of-the-art multicore architectures. 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis. https://doi.org/10.1109/sc.2008.5222004
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.