The DOI matches its Crossref record.
Cache oblivious stencil computations
Abstract
We present a cache oblivious algorithm for stencil computations, which arise for example in finite-difference methods. Our algorithm applies to arbitrary stencils in n-dimensional spaces. On an "ideal cache" of size Z, our algorithm saves a factor of Θ(Z1/n) cache misses compared to a naive algorithm, and it exploits temporal locality optimally throughout the entire memory hierarchy.
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
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
Christen, M., Schenk, O., & Burkhart, H. (2011) · 2011 IEEE International Parallel & Distributed Processing Symposium · doi:10.1109/ipdps.2011.70 · Cited by 311
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
Lattice 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
Metadata
- Authors
- Frigo, M., & Strumpen, V.
- Venue
- Proceedings of the 19th annual international conference on Supercomputing
- Publisher
- ACM
- Published
- 2005-06-20
- Pages
- 361-366
- OpenAlex
- W1968013322
- Cited by
- 184
- References
- 0
- FWCI
- 3.57
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Cache oblivious stencil computations. https://app.cochat.ai/papers/10.1145/1088149.1088197
- The paper
- Frigo, M., & Strumpen, V. (2005). Cache oblivious stencil computations. Proceedings of the 19th annual international conference on Supercomputing. https://doi.org/10.1145/1088149.1088197
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.