CoChat

Implicit and explicit optimizations for stencil computations

Open access
Kamil, Shoaib, Datta, Kaushik, Williams, Samuel, Oliker, Leonid, Shalf, John, Yelick, Katherine · 2006 · Proceedings of the 2006 workshop on Memory system performance and correctness

The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.

Abstract

Stencil-based kernels constitute the core of many 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. We examine several optimizations on both the conventional cache-based memory systems of the Itanium 2, Opteron, and Power5, as well as the heterogeneous multicore design of the Cell processor. The optimizations target cache reuse across stencil sweeps, including both an implicit cache oblivious approach and a cache-aware algorithm blocked to match the cache structure. Finally, we consider stencil computations on a machine with an explicitly-managed memory hierarchy, the Cell processor. Overall, results show that a cache-aware approach is significantly faster than a cache oblivious approach and that the explicitly managed memory on Cell is more efficient: Relative to the Power5, it has almost 2x more memory bandwidth and is 3.7x faster.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1178597.1178605

Cites

11 of 11 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 11 references

Research works printed but not linked: 1

  1. 10.5555/846234.849346 · doi:10.5555/846234.849346

Cited by

See all 132

Metadata

Authors
Kamil, S., Datta, K., Williams, S., Oliker, L., Shalf, J., & Yelick, K.
Affiliations
  • Lawrence Berkeley National Laboratory (US)
  • University of California, Berkeley (US)
Venue
Proceedings of the 2006 workshop on Memory system performance and correctness
Publisher
ACM
Published
2006-10-22
Pages
51-60
OpenAlex
W2129471558
Cited by
130
References
11
Citations by year
2026: 1 · 2025: 1 · 2024: 1 · 2023: 1 · 2021: 4 · 2020: 5 · 2019: 4 · 2018: 4 · 2017: 12 · 2016: 7 · 2015: 10 · 2014: 6 · 2013: 6 · 2012: 11
FWCI
7.49
Type
conference paper
Language
en
Open access
Locations
  • eScholarship (California Digital Library) (submittedVersion)
  • OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
Keywords
stencil computations, cache-aware algorithms, cache-oblivious algorithms, memory hierarchy, Cell processor, multi-core processors, block-structured grids, memory bandwidth, cache reuse, Itanium 2

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: Implicit and explicit optimizations for stencil computations. https://app.cochat.ai/papers/10.1145/1178597.1178605
The paper
Kamil, S., Datta, K., Williams, S., Oliker, L., Shalf, J., & Yelick, K. (2006). Implicit and explicit optimizations for stencil computations. Proceedings of the 2006 workshop on Memory system performance and correctness. https://doi.org/10.1145/1178597.1178605

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.