The DOI matches its Crossref record.
Memory---A memory model for scientific algorithms on graphics processors
Abstract
We present a memory model to analyze and improve the performance of scientific algorithms on graphics processing units (GPUs). Our memory model is based on texturing hardware, which uses a 2D block-based array representation to perform the underlying computations. We incorporate many characteristics of GPU architectures including smaller cache sizes, 2D block representations, and use the 3C's model to analyze the cache misses. Moreover. we present techniques to improve the performance of nested loops on GPUs. In order to demonstrate the effectiveness of our model, we highlight its performance on three memory-intensive scientific applications - sorting, fast Fourier transform and dense matrix-multiplication. In practice, our cache-efficient algorithms for these applications are able to achieve memory throughput of 30-50 GB/s on a NVIDIA 7900 GTX GPU. We also compare our results with prior GPU-based and CPU-based implementations on high-end processors. In practice, we are able to achieve 2-5 x performance improvement.
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
A Survey of General‐Purpose Computation on Graphics Hardware
Owens, J. D., Luebke, D., Govindaraju, N., Harris, M., Krüger, J., Lefohn, A. E., & Purcell, T. J. (2007) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2007.01012.x · Cited by 2,101
Self-citationOptimization principles and application performance evaluation of a multithreaded GPU using CUDA
Ryoo, S., Rodrigues, C. I., Baghsorkhi, S. S., Stone, S. S., Kirk, D. B., & Hwu, W.-M. W. (2008) · Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming · doi:10.1145/1345206.1345220 · Cited by 903
Benchmarking GPUs to tune dense linear algebra
Volkov, V. M., & Demmel, J. W. (2008) · doi:10.5555/1413370.1413402 · Cited by 701
Benchmarking GPUs to tune dense linear algebra
Volkov, V., & Demmel, J. W. (2008) · 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2008.5214359 · Cited by 489
High-throughput sequence alignment using Graphics Processing Units
Schatz, M. C., Trapnell, C., Delcher, A. L., & Varshney, A. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-474 · Cited by 310
Metadata
- Authors
- Govindaraju, N. K., Larsen, S., Gray, J., & Manocha, D.
- Venue
- Proceedings of the 2006 ACM/IEEE conference on Supercomputing - SC '06
- Publisher
- ACM Press
- Published
- 2006
- Pages
- 89
- OpenAlex
- W2108792719
- Cited by
- 174
- References
- 0
- Type
- conference abstract
- 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: Memory---A memory model for scientific algorithms on graphics processors. https://app.cochat.ai/papers/10.1145/1188455.1188549
- The paper
- Govindaraju, N. K., Larsen, S., Gray, J., & Manocha, D. (2006). Memory---A memory model for scientific algorithms on graphics processors. Proceedings of the 2006 ACM/IEEE conference on Supercomputing - SC '06. https://doi.org/10.1145/1188455.1188549
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.