The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
PyCUDA and PyOpenCL: A scripting-based approach to GPU run-time code generation
Open accessAbstract
High-performance computing has recently seen a surge of interest in heterogeneous systems, with an emphasis on modern Graphics Processing Units (GPUs). These devices offer tremendous potential for performance and efficiency in important large-scale applications of computational science. However, exploiting this potential can be challenging, as one must adapt to the specialized and rapidly evolving computing environment currently exhibited by GPUs. One way of addressing this challenge is to embrace better techniques and develop tools tailored to their needs. This article presents one simple technique, GPU run-time code generation (RTCG), along with PyCUDA and PyOpenCL, two open-source toolkits that supports this technique. In introducing PyCUDA and PyOpenCL, this article proposes the combination of a dynamic, high-level scripting language with the massive performance of a GPU as a compelling two-tiered computing platform, potentially offering significant performance and productivity advantages over conventional single-tier, static systems. The concept of RTCG is simple and easily implemented using existing, robust infrastructure. Nonetheless it is powerful enough to support (and encourage) the creation of custom application-specific tools by its users. The premise of the paper is illustrated by a wide range of examples where the technique has been applied with considerable success.
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
Methods of conjugate gradients for solving linear systems
Hestenes, M. R., & Stiefel, E. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.044 · Cited by 8,132
The Design and Implementation of FFTW3
Frigo, M., & Johnson, S. G. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840301 · Cited by 5,086
A Bridging Model for Parallel Computation
Valiant, L. G. (1990) · ACM eBooks · doi:10.1145/3749740.3749753 · Cited by 3,664
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
Synthesis and evaluation of linear motion transitions
Wang, J., & Bodenheimer, B. (2008) · ACM Transactions on Graphics · doi:10.1145/1330511.1330512 · Cited by 1,534
NVIDIA Tesla: A Unified Graphics and Computing Architecture
Lindholm, E., Nickolls, J., Oberman, S., & Montrym, J. (2008) · IEEE Micro · doi:10.1109/mm.2008.31 · Cited by 1,362
Automated empirical optimizations of software and the ATLAS project
Clint Whaley, R., Petitet, A., & Dongarra, J. J. (2001) · Parallel Computing · doi:10.1016/s0167-8191(00)00087-9 · Cited by 1,317
Brook for GPUs: stream computing on graphics hardware
Buck, I., Foley, T., Horn, D., Sugerman, J., Fatahalian, K., Houston, M., & Hanrahan, P. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015800 · Cited by 1,155
Independent component filters of natural images compared with simple cells in primary visual cortex
van Hateren, J. H., & van der Schaaf, A. (1998) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.1998.0303 · Cited by 1,106
Optimizing Compilers for Modern Architectures: A Dependence-based Approach
Kennedy, K., & Allen, J. R. (2001) · Cited by 1,002
Implementing sparse matrix-vector multiplication on throughput-oriented processors
Bell, N., & Garland, M. (2009) · Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis · doi:10.1145/1654059.1654078 · Cited by 900
Larrabee: a many-core x86 architecture for visual computing
Seiler, L., Carmean, D., Sprangle, E., Forsyth, T., Abrash, M., Dubey, P., Junkins, S., Lake, A., Sugerman, J., Cavin, R., et al. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360617 · Cited by 771
McCarthy, J., Abrahams, P. W., Edwards, D. J., Hart, T. P., & Levin, M. I. (1962) · doi:10.21236/ad0406138 · Cited by 555
Dalcín, L., Paz, R., & Storti, M. (2005) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2005.03.010 · Cited by 408
Nodal discontinuous Galerkin methods on graphics processors
Klöckner, A., Warburton, T., Bridge, J., & Hesthaven, J. S. (2009) · Journal of Computational Physics · doi:10.1016/j.jcp.2009.06.041 · Cited by 321
Self-citationAccelerator: 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
Pinto, N., Doukhan, D., DiCarlo, J. J., & Cox, D. D. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000579 · Cited by 248
Self-citationParallel Programming Using C++
(1996) · The MIT Press eBooks · doi:10.7551/mitpress/5241.001.0001 · Cited by 204
Beyond simple features: A large-scale feature search approach to unconstrained face recognition
Cox, D., & Pinto, N. (2011) · Face and Gesture 2011 · doi:10.1109/fg.2011.5771385 · Cited by 197
Self-citationFeldman, J., & Gries, D. (1968) · Communications of the ACM · doi:10.1145/362896.362902 · Cited by 194
Python Scripting for Computational Science
Langtangen, H. P. (2007) · Texts in computational science and engineering · doi:10.1007/978-3-540-73916-6 · Cited by 190
Han, T. D., & Abdelrahman, T. S. (2009) · doi:10.1145/1513895.1513902 · Cited by 150
McCool, M. D., & Toit, S. D. (2009) · A K Peters/CRC Press eBooks · doi:10.1201/9781568816692 · Cited by 84
Chandler, D. M., & Field, D. J. (2007) · Journal of the Optical Society of America A · doi:10.1364/josaa.24.000922 · Cited by 60
GPU-accelerated synthetic aperture radar backprojection in CUDA
Fasih, A. R., & Hartley, T. D. R. (2010) · IEEE Radar Conference (RadarConf) · doi:10.1109/radar.2010.5494395 · Cited by 46
Self-citation
Cited by
MEG and EEG data analysis with MNE-Python
Gramfort, A. (2013) · Frontiers in Neuroscience · doi:10.3389/fnins.2013.00267 · Cited by 3,784
The fast azimuthal integration Python library:pyFAI
Ashiotis, G., Deschildre, A., Nawaz, Z., Wright, J. P., Karkoulis, D., Picca, F. E., & Kieffer, J. (2015) · Journal of Applied Crystallography · doi:10.1107/s1600576715004306 · Cited by 927
Nengo: a Python tool for building large-scale functional brain models
Bekolay, T., Bergstra, J., Hunsberger, E., DeWolf, T., Stewart, T. C., Rasmussen, D., Choo, X., Voelker, A. R., & Eliasmith, C. (2014) · Frontiers in Neuroinformatics · doi:10.3389/fninf.2013.00048 · Cited by 500
A mixed-scale dense convolutional neural network for image analysis
Pelt, D. M., & Sethian, J. A. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1715832114 · Cited by 270
SDN-Enabled Energy-Efficient Routing Optimization Framework for Industrial Internet of Things
Naeem, F., Tariq, M., & Poor, H. V. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.3006885 · Cited by 83
Metadata
- Authors
- Klöckner, A., Pinto, N., Lee, Y., Catanzaro, B., Ivanov, P., & Fasih, A.
- Venue
- Parallel Computing
- Publisher
- Elsevier BV
- Published
- 2012-03
- Volume
- 38
- Issue
- 3
- Pages
- 157-174
- ISSN
- 0167-8191 (ISSN-L)
- OpenAlex
- W1985462363
- Cited by
- 573
- References
- 25
- FWCI
- 50.23
- Type
- journal article
- Language
- en
- Open access
- green
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.