CoChat

Cache-Efficient Multigrid Algorithms

Sellappa, Sriram, Chatterjee, Siddhartha · 2004 · The International Journal of High Performance Computing Applications

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

Abstract

Multigrid is widely used as an efficient solver for sparse linear systems arising from the discretization of elliptic boundary value problems. Linear relaxation methods such as Gauss–Seidel and Red–Black Gauss–Seidel form the principal computational component of multigrid, and thus affect its efficiency. In the context of multigrid, these iterative solvers are executed for a small number of iterations (2–8). We exploit this property of the algorithm to develop a cache-efficient multigrid method, by focusing on improving the memory behavior of the linear relaxation methods. The efficiency in our cache-efficient linear relaxation algorithm comes from two sources: reducing the number of data cache and TLB misses, and reducing the number of memory references by keeping values registerresident. Our optimizations are applicable to multigrid applied to linear systems arising from constant coefficient elliptic PDEs on structured grids. Experiments on five modern computing platforms show a performance improvement of 1.15–2.7 times over a standard implementation of Full Multigrid V-Cycle.

Overview

Integrity signals

Registry

Crossref · 10.1177/1094342004041295

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 21 references

Cited by

See all 62

Metadata

Authors
Sellappa, S., & Chatterjee, S.
Affiliations
  • ANDIAMO SYSTEMS INC. SAN JOSE, CA 95134, USA
  • IBM (United States) (US)
Venue
The International Journal of High Performance Computing Applications
Published
2004-02
Volume
18
Issue
1
Pages
115-133
ISSN
  • 0890-2720 (ISSN-L)
  • 1094-3420
  • 1741-2846
OpenAlex
W2152914333
Cited by
49
References
21
Citations by year
2025: 1 · 2024: 1 · 2023: 1 · 2020: 1 · 2019: 2 · 2018: 1 · 2017: 1 · 2016: 2 · 2015: 2 · 2014: 2 · 2013: 2 · 2012: 4
FWCI
5.78
Type
journal article
Language
en
Open access
closed
Licence
journals.sagepub.com/page/policies/text-and-data-mining-license (tdm)
Locations
The International Journal of High Performance Computing Applications (publishedVersion)
Funders
  • Scheme for Promotion of Academic and Research Collaboration
  • University of North Carolina at Chapel Hill
Topics
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
  • Physical Sciences › Engineering › Computational Mechanics › Advanced Numerical Methods in Computational Mathematics
Keywords
multigrid methods, cache efficiency, Gauss-Seidel method, sparse linear systems, elliptic boundary value problems, memory access optimization, TLB misses, structured grids, iterative solvers

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-Efficient Multigrid Algorithms. https://app.cochat.ai/papers/10.1177/1094342004041295
The paper
Sellappa, S., & Chatterjee, S. (2004). Cache-Efficient Multigrid Algorithms. The International Journal of High Performance Computing Applications. https://doi.org/10.1177/1094342004041295

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.