Cache-Efficient Multigrid Algorithms
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
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Briggs, W. L. (1987) · Cited by 1,868
A Multigrid Tutorial, Second Edition
Briggs, W. L., Henson, V. E., & McCormick, S. F. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719505 · Cited by 1,510
A data locality optimizing algorithm
Wolf, M. E., & Lam, M. S. (1991) · Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation - PLDI '91 · doi:10.1145/113445.113449 · Cited by 1,331
The cache performance and optimizations of blocked algorithms
Lam, M. D., Rothberg, E. E., & Wolf, M. E. (1991) · Proceedings of the fourth international conference on Architectural support for programming languages and operating systems - ASPLOS-IV · doi:10.1145/106972.106981 · Cited by 921
Evaluating associativity in CPU caches
Hill, M. D., & Smith, A. J. (1989) · IEEE Transactions on Computers · doi:10.1109/12.40842 · Cited by 606
Wolfe, M. (1989) · Proceedings of the 1989 ACM/IEEE conference on Supercomputing - Supercomputing '89 · doi:10.1145/76263.76337 · Cited by 429
Cache profiling and the SPEC benchmarks: a case study
Lebeck, A. R., & Wood, D. A. (1994) · Computer · doi:10.1109/2.318580 · Cited by 216
Performance analysis using the MIPS R10000 performance counters
Zagha, M., Larson, B., Turner, S., & Itzkowitz, M. (1996) · Proceedings of the 1996 ACM/IEEE conference on Supercomputing · doi:10.1145/369028.369059 · Cited by 210
Nonlinear array layouts for hierarchical memory systems
Chatterjee, S., Jain, V. V., Lebeck, A. R., Mundhra, S., & Thottethodi, M. (1999) · Proceedings of the 13th international conference on Supercomputing · doi:10.1145/305138.305231 · Cited by 163
Self-citationCache Optimization for Structured and Unstructured Grid Multigrid
Douglas, C. C., Hu, J. J., Kowarschik, M., Rüde, U., & Weiß, C. H. (2000) · UKnowledge (University of Kentucky) · Cited by 145
Cited by
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
Christen, M., Schenk, O., & Burkhart, H. (2011) · 2011 IEEE International Parallel & Distributed Processing Symposium · doi:10.1109/ipdps.2011.70 · Cited by 311
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
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
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
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
- Publisher
- SAGE Publications
- 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.