The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Program optimization space pruning for a multithreaded gpu
Abstract
Program optimization for highly-parallel systems has historically been considered an art, with experts doing much of the performance tuning by hand. With the introduction of inexpensive, single-chip, massively parallel platforms, more developers will be creating highly-parallel applications for these platforms, who lack the substantial experience and knowledge needed to maximize their performance. This creates a need for more structured optimization methods with means to estimate their performance effects. Furthermore these methods need to be understandable by most programmers. This paper shows the complexity involved in optimizing applications for one such system and one relatively simple methodology for reducing the workload involved in the optimization process.
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.
Integrity signals
Registry
Cites
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.
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
Optimizing Compilers for Modern Architectures: A Dependence-based Approach
Kennedy, K., & Allen, J. R. (2001) · Cited by 1,002
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
Optimization 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
Self-citationAccelerating molecular modeling applications with graphics processors
Stone, J. E., Phillips, J. C., Freddolino, L., Hardy, D. J., Trabuco, L. G., & Schulten, K. (2007) · Journal of Computational Chemistry · doi:10.1002/jcc.20829 · Cited by 739
Supercompilers for parallel and vector computers
Zima, H. P., & Chapman, B. (1990) · CERN Document Server (European Organization for Nuclear Research) · Cited by 650
Maximizing multiprocessor performance with the SUIF compiler
Hall, M. W., Anderson, J. M., Amarasinghe, S. P., Murphy, B. R., Liao, S.-W., Bugnion, E., & Lam, M. S. (1996) · Computer · doi:10.1109/2.546613 · Cited by 572
NVIDIA cuda software and gpu parallel computing architecture
Kirk, D. (2007) · Proceedings of the 6th international symposium on Memory management · doi:10.1145/1296907.1296909 · Cited by 435
Using Machine Learning to Focus Iterative Optimization
Agakov, F. V., Bonilla, E. V., Cavazos, J. E., Franke, B., Fursin, G., O’boyle, M. F. P., Thomson, J. D., Toussaint, M., & Williams, C. K. I. (2006) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo.2006.37 · Cited by 426
Understanding the efficiency of GPU algorithms for matrix-matrix multiplication
Fatahalian, K., Sugerman, J., & Hanrahan, P. (2004) · Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware · doi:10.1145/1058129.1058148 · Cited by 309
Accelerator: using data parallelism to program GPUs for general-purpose uses
Tarditi, D., Puri, S., & Oglesby, J. (2006) · Proceedings of the 12th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1168857.1168898 · Cited by 294
Compiler Optimization-Space Exploration
Triantafyllis, S., Vachharajani, M., Vachharajani, N., & August, D. I. (2003) · Cited by 195
Combined Selection of Tile Sizes and Unroll Factors Using Iterative Compilation
Kisuki, T., Knijnenburg, P. M. W., & O’Boyle, M. (2000) · doi:10.5555/517554.825767 · Cited by 177
Memory---A memory model for scientific algorithms on graphics processors
Govindaraju, N. K., Larsen, S., Gray, J., & Manocha, D. (2006) · Proceedings of the 2006 ACM/IEEE conference on Supercomputing - SC '06 · doi:10.1145/1188455.1188549 · Cited by 174
Finding effective compilation sequences
Almagor, L., Cooper, K. D., Grosul, A., Harvey, T. J., Reeves, S. W., Subramanian, D., Torczon, L., & Waterman, T. (2004) · ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES) · doi:10.1145/997163.997196 · Cited by 169
Proceedings of the 2018 International Symposium on Code Generation and Optimization
Knoop, J., Austria, C. '. 1. A. I. I. S. O. C. G. A. O. 2. V., Association for Computing Machinery-Digital Library, ACM Special Interest Group on Microarchitecture, ACM Special Interest Group on Programming Languages, & SIGs, A. (2018) · doi:10.1145/3179541 · Cited by 143
Precise miss analysis for program transformations with caches of arbitrary associativity
Ghosh, S., Martonosi, M., & Malik, S. (1998) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/291069.291051 · Cited by 112
Automatic selection of compiler options using non-parametric inferential statistics
Haneda, M., Knijnenburg, P. M. W., & Wijshoff, H. A. G. (2005) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1109/pact.2005.9 · Cited by 68
Automatic tuning matrix multiplication performance on graphics hardware
Jiang, C., & Snir, M. (2005) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1109/pact.2005.10 · Cited by 62
Evaluating Heuristic Optimization Phase Order Search Algorithms
Davidson, J. W., Tyson, G., Whalley, D. B., & Kulkarni, P. A. (2007) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo.2007.9 · Cited by 50
Performance Analysis of Cell Broadband Engine for High Memory Bandwidth Applications
Jiménez-González, D., Martorell, X., & Ramírez, A. (2007) · IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS) · doi:10.1109/ispass.2007.363751 · Cited by 29
Software Support For Improving Locality in Scientific Codes
Han, H., Rivera, G., & Tseng, C. (2001) · Cited by 21
Cited by
Analyzing CUDA workloads using a detailed GPU simulator
Bakhoda, A., Yuan, G. L., Fung, W. W. L., Wong, H., & Aamodt, T. M. (2009) · 2009 IEEE International Symposium on Performance Analysis of Systems and Software · doi:10.1109/ispass.2009.4919648 · Cited by 1,663
Polyhedral parallel code generation for CUDA
Verdoolaege, S., Carlos Juega, J., Cohen, A., Ignacio Gómez, J., Tenllado, C., & Catthoor, F. (2013) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/2400682.2400713 · Cited by 382
A GPGPU compiler for memory optimization and parallelism management
Yang, Y., Xiang, P., Kong, J., & Zhou, H. (2010) · Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1806596.1806606 · Cited by 273
Accelerating advanced MRI reconstructions on GPUs
Stone, S. S., Haldar, J. P., Tsao, S. C., Hwu, W.-M. W., Sutton, B. P., & Liang, Z.-P. (2008) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2008.05.013 · Cited by 249
Self-citationOn the Efficacy of a Fused CPU+GPU Processor (or APU) for Parallel Computing
Daga, M., Aji, A. M., & Feng, W.-C. (2011) · 2011 Symposium on Application Accelerators in High-Performance Computing · doi:10.1109/saahpc.2011.29 · Cited by 84
Metadata
- Authors
- Ryoo, S., Rodrigues, C. I., Stone, S. S., Baghsorkhi, S. S., Ueng, S.-Z., Stratton, J. A., & Hwu, W.-M. W.
- Venue
- Proceedings of the 6th annual IEEE/ACM international symposium on Code generation and optimization
- Publisher
- ACM
- Published
- 2008-04-06
- Pages
- 195-204
- OpenAlex
- W2153492376
- Cited by
- 285
- References
- 21
- FWCI
- 23.42
- 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
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.