The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
PATUS: A Code Generation and Autotuning Framework for Parallel Iterative Stencil Computations on Modern Microarchitectures
Abstract
Stencil calculations comprise an important class of kernels in many scientific computing applications ranging from simple PDE solvers to constituent kernels in multigrid methods as well as image processing applications. In such types of solvers, stencil kernels are often the dominant part of the computation, and an efficient parallel implementation of the kernel is therefore crucial in order to reduce the time to solution. However, in the current complex hardware micro architectures, meticulous architecture-specific tuning is required to elicit the machine's full compute power. We present a code generation and auto-tuning framework \textsc{Patus} for stencil computations targeted at multi- and many core processors, such as multicore CPUs and graphics processing units, which makes it possible to generate compute kernels from a specification of the stencil operation and a parallelization and optimization strategy, and leverages the auto tuning methodology to optimize strategy-dependent parameters for the given hardware architecture.
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
Cites
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
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
Analysis of Tissue and Arterial Blood Temperatures in the Resting Human Forearm
Pennes, H. H. (1948) · Journal of Applied Physiology · doi:10.1152/jappl.1948.1.2.93 · Cited by 4,646
Analysis of Tissue and Arterial Blood Temperatures in the Resting Human Forearm
Pennes, H. H. (1998) · Journal of Applied Physiology · doi:10.1152/jappl.1998.85.1.5 · Cited by 3,982
(2006) · Cited by 1,979
A practical automatic polyhedral parallelizer and locality optimizer
Bondhugula, U., Hartono, A., Ramanujam, J., & Sadayappan, P. (2008) · Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1375581.1375595 · Cited by 880
Automatically Tuned Linear Algebra Software
Whaley, R. C., & Dongarra, J. J. (1998) · Conference on High Performance Computing (Supercomputing) · doi:10.5555/509058.509096 · Cited by 854
SPIRAL: Code Generation for DSP Transforms
Puschel, M., Moura, J. M. F., Johnson, J. R., Padua, D., Veloso, M. M., Singer, B. W., Xiong, J., Franchetti, F., Gacic, A., Voronenko, Y., et al. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840306 · Cited by 826
Munshi, A. (2009) · IEEE Hot Chips Symposium · doi:10.1109/hotchips.2009.7478342 · Cited by 648
Automatically Tuned Linear Algebra Software
Whaley, R. C., & Dongarra, J. J. (1998) · Proceedings of the IEEE/ACM SC98 Conference · doi:10.1109/sc.1998.10004 · Cited by 527
3D finite difference computation on GPUs using CUDA
Micikevicius, P. (2009) · Proceedings of 2nd Workshop on General Purpose Processing on Graphics Processing Units · doi:10.1145/1513895.1513905 · Cited by 520
OSKI: A library of automatically tuned sparse matrix kernels
Vuduc, R., Demmel, J. W., & Yelick, K. A. (2005) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/16/1/071 · Cited by 490
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 · cited 2×
“This is one of the key features in which PATUS differs from other code generation and autotuning frameworks for stencil codes, such as the one proposed by Kamil [1].”
BackgroundCetus: A Source-to-Source Compiler Infrastructure for Multicores
Dave, C., Bae, H., Min, S.-J., Lee, S., Eigenmann, R., & Midkiff, S. P. (2009) · Computer · doi:10.1109/mc.2009.385 · Cited by 205
Cache oblivious stencil computations
Frigo, M., & Strumpen, V. (2005) · Proceedings of the 19th annual international conference on Supercomputing · doi:10.1145/1088149.1088197 · Cited by 184
Tiling Optimizations for 3D Scientific Computations
Rivera, G., & Tseng, C. (2000) · Cited by 173
Tiling Optimizations for 3D Scientific Computations
Rivera, G., & Tseng, C.-W. (2000) · ACM/IEEE SC 2000 Conference (SC'00) · doi:10.1109/sc.2000.10015 · Cited by 127
Loop Transformation Recipes for Code Generation and Auto-Tuning
Hall, M. W., Chame, J., Chen, C., Shin, J., Rudy, G., & Khan, M. M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13374-9_4 · Cited by 105
Parameterized tiled loops for free
Renganarayanan, L., Kim, D., Rajopadhye, S. V., & Strout, M. M. (2007) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1250734.1250780 · Cited by 80
(2009) · Cited by 77
Cache oblivious parallelograms in iterative stencil computations
Strzodka, R., Shaheen, M., Pająk, D., & Seidel, H. (2010) · International Conference on Supercomputing · doi:10.1145/1810085.1810096 · Cited by 54
Cache-Efficient Multigrid Algorithms
Sellappa, S., & Chatterjee, S. (2004) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342004041295 · Cited by 49
A Performance Study for Iterative Stencil Loops on GPUs with Ghost Zone Optimizations
Meng, J., & Kevin Skadron, Y. (2010) · International Journal of Parallel Programming · doi:10.1007/s10766-010-0142-5 · Cited by 47
Time Skewing for Parallel Computers
Wonnacott, D. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44905-1_35 · Cited by 40
Parallel data-locality aware stencil computations on modern micro-architectures
Christen, M., Schenk, O., Neufeld, E., Messmer, P., & Burkhart, H. (2009) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2009.5161031 · Cited by 22
Self-citationAuto-tuning Stencil Computations on Multicore and Accelerators
Datta, K., Williams, S., Volkov, V. M., Carter, J. T., Oliker, L., Shalf, J. M., & Yelick, K. (2010) · eScholarship (California Digital Library) · Cited by 7
Manycore Stencil Computations in Hyperthermia Applica- tions
Christen, M., Schenk, O., Neufeld, E., Paulides, M., & Burkhart, H. (2010) · CRC Press eBooks · doi:10.1201/b10376-26 · Cited by 3
Self-citation
Cited by
OpenTuner: an extensible framework for program autotuning
Ansel, J., Kamil, S., Veeramachaneni, K., Ragan-Kelley, J., Bosboom, J., O'Reilly, U.-M., & Amarasinghe, S. (2014) · Proceedings of the 23rd international conference on Parallel architectures and compilation · doi:10.1145/2628071.2628092 · Cited by 530
Metadata
- Authors
- Christen, M., Schenk, O., & Burkhart, H.
- Venue
- 2011 IEEE International Parallel & Distributed Processing Symposium
- Publisher
- IEEE
- Published
- 2011-05
- Pages
- 676-687
- ISSN
- 1530-2075 (ISSN-L)
- OpenAlex
- W2104512032
- Cited by
- 311
- References
- 28
- FWCI
- 18.60
- 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.