A practical automatic polyhedral parallelizer and locality optimizer
The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Abstract
We present the design and implementation of an automatic polyhedral source-to-source transformation framework that can optimize regular programs (sequences of possibly imperfectly nested loops) for parallelism and locality simultaneously. Through this work, we show the practicality of analytical model-driven automatic transformation in the polyhedral model -- far beyond what is possible by current production compilers. Unlike previous works, our approach is an end-to-end fully automatic one driven by an integer linear optimization framework that takes an explicit view of finding good ways of tiling for parallelism and locality using affine transformations. The framework has been implemented into a tool to automatically generate OpenMP parallel code from C program sections. Experimental results from the tool show very high speedups for local and parallel execution on multi-cores over state-of-the-art compiler frameworks from the research community as well as the best native production compilers. The system also enables the easy use of powerful empirical/iterative optimization for general arbitrarily nested loop sequences.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
A generalized inverse for matrices
Penrose, R. (1955) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100030401 · Cited by 4,551
Theory of Linear and Integer Programming
Smith, D. K. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.94 · Cited by 2,708
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
Automatic translation of FORTRAN programs to vector form
Allen, R., & Kennedy, K. (1987) · ACM Transactions on Programming Languages and Systems · doi:10.1145/29873.29875 · Cited by 734
A loop transformation theory and an algorithm to maximize parallelism
Wolf, M. E., & Lam, M. S. (1991) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.97902 · Cited by 643
A practical algorithm for exact array dependence analysis
Pugh, W. (1992) · Communications of the ACM · doi:10.1145/135226.135233 · Cited by 568
Dataflow analysis of array and scalar references
Feautrier, P. (1991) · International Journal of Parallel Programming · doi:10.1007/bf01407931 · Cited by 567
Irigoin, F., & Triolet, R. (1988) · Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88 · doi:10.1145/73560.73588 · Cited by 564
Some efficient solutions to the affine scheduling problem. I. One-dimensional time
Feautrier, P. (1992) · International Journal of Parallel Programming · doi:10.1007/bf01407835 · Cited by 555
Code generation in the polyhedral model is easier than you think
Bastoul, C. (2004) · Proceedings. 13th International Conference on Parallel Architecture and Compilation Techniques, 2004. PACT 2004. · doi:10.1109/pact.2004.1342537 · Cited by 447
Research works printed but not linked: 13
- 10.5555/1025127.1025992 · doi:10.5555/1025127.1025992
- 10.5555/1765931.1765962 · doi:10.5555/1765931.1765962
- 10.5555/1788374.1788386 · doi:10.5555/1788374.1788386
- 10.5555/556139 · doi:10.5555/556139
- 10.1007/BF01407835 · DOI · Paper page
- Goumas G., 2002, Code Generation Methods for Tiling Transformations. J. of Information Science and Engineering, 18, 667
- Kelly W., 1995, Intl. Symp. on the frontiers of massively parallel computation, 332
- Norris B., 2007, Annotations for performance and productivity
- Pop S., 2006, Proc. of the 4th GCC Developper?s summit
- Schreiber R., 1990, Automatic blocking of nested loops. Technical report
- Whaley R., 2000, Parallel Computing
- Wilde D. K., 1993, IRISA
- 10.5555/353939 · doi:10.5555/353939
Cited by
MLIR: Scaling Compiler Infrastructure for Domain Specific Computation
Lattner, C., Amini, M., Bondhugula, U., Cohen, A., Davis, A., Pienaar, J., Riddle, R., Shpeisman, T., Vasilache, N., & Zinenko, O. (2021) · 2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO) · doi:10.1109/cgo51591.2021.9370308 · Cited by 541
Self-citationTensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions
Vasilache, N., Zinenko, O., Theodoridis, T., Goyal, P., DeVito, Z., Moses, W. S., Verdoolaege, S., Adams, A., & Cohen, A. (2018) · arXiv · doi:10.48550/arxiv.1802.04730 · Cited by 548
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
Memory-centric accelerator design for Convolutional Neural Networks
Peemen, M., Setio, A. A. A., Mesman, B., & Corporaal, H. (2013) · 2013 IEEE 31st International Conference on Computer Design (ICCD) · doi:10.1109/iccd.2013.6657019 · Cited by 332
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
Tiling stencil computations to maximize parallelism
Bandishti, V., Pananilath, I., & Bondhugula, U. (2012) · 2012 International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2012.107 · Cited by 175
Self-citationDNNFusion: accelerating deep neural networks execution with advanced operator fusion
Niu, W., Guan, J., Wang, Y., Agrawal, G., & Ren, B. (2021) · Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation · doi:10.1145/3453483.3454083 · Cited by 166
Polygeist: Raising C to Polyhedral MLIR
Moses, W. S., Chelini, L., Zhao, R., & Zinenko, O. (2021) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1109/pact52795.2021.00011 · Cited by 109
dMazeRunner: Executing Perfectly Nested Loops on Dataflow Accelerators
Dave, S., Kim, Y., Avancha, S., Lee, K., & Shrivastava, A. (2019) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3358198 · Cited by 106
AKG: automatic kernel generation for neural processing units using polyhedral transformations
Zhao, J., Li, B., Nie, W., Geng, Z., Zhang, R., Gao, X., Cheng, B., Wu, C. H., Cheng, Y., Li, Z., et al. (2021) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3453483.3454106 · Cited by 118
Multicore-Optimized Wavefront Diamond Blocking for Optimizing Stencil Updates
Malas, T. B., Hager, G., Ltaief, H., Stengel, H., Wellein, G., & Keyes, D. E. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/140991133 · Cited by 76
Cache Accurate Time Skewing in Iterative Stencil Computations
Strzodka, R., Shaheen, M., Pająk, D., & Seidel, H. (2011) · Proceedings of the International Conference on Parallel Processing · doi:10.1109/icpp.2011.47 · Cited by 70
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
Polly-ACC Transparent compilation to heterogeneous hardware
Grosser, T., & Hoefler, T. (2016) · International Conference on Supercomputing · doi:10.1145/2925426.2926286 · Cited by 55
Loop Tiling in Large-Scale Stencil Codes at Run-Time with OPS
Reguly, I. Z., Mudalige, G. R., & Giles, M. B. (2017) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2017.2778161 · Cited by 60
Programming and Synthesis for Software-defined FPGA Acceleration: Status and Future Prospects
Lai, Y., Ustun, E., Xiang, S., Fang, Z., Rong, H., & Zhang, Z. (2021) · ACM Transactions on Reconfigurable Technology and Systems · doi:10.1145/3469660 · Cited by 63
Many-Body Quantum Chemistry on Massively Parallel Computers
Calvin, J. A., Peng, C., Rishi, V., Kumar, A., & Valeev, E. F. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.0c00006 · Cited by 48
Getting to the point: index sets and parallelism-preserving autodiff for pointful array programming
Paszke, A., Johnson, D. D., Duvenaud, D., Vytiniotis, D., Radul, A., Johnson, M. J., Ragan‐Kelley, J., & Maclaurin, D. (2021) · Proceedings of the ACM on Programming Languages · doi:10.1145/3473593 · Cited by 70
Modeling the conflicting demands of parallelism and Temporal/Spatial locality in affine scheduling
Zinenko, O., Verdoolaege, S., Reddy, C., Shirako, J., Grosser, T., Sarkar, V., & Cohen, A. (2018) · doi:10.1145/3178372.3179507 · Cited by 44
Multidimensional Intratile Parallelization for Memory-Starved Stencil Computations
Malas, T. M., Hager, G., Ltaief, H., & Keyes, D. E. (2017) · ACM Transactions on Parallel Computing · doi:10.1145/3155290 · Cited by 40
Polyhedral-Based Dynamic Loop Pipelining for High-Level Synthesis
Liu, J., Wickerson, J., Bayliss, S., & Constantinides, G. A. (2017) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2017.2783363 · Cited by 37
Multithreaded Geant4: Semi-automatic Transformation into Scalable Thread-Parallel Software
Dong, X., Cooperman, G. D., & Apostolakis, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15291-7_27 · Cited by 34
Natale, G., Stramondo, G., Bressana, P., Cattaneo, R., Sciuto, D., & Santambrogio, M. D. (2016) · doi:10.1145/2966986.2966995 · Cited by 32
A fast analytical model of fully associative caches
Gysi, T., Grosser, T., Brandner, L., & Hoefler, T. (2019) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3314221.3314606 · Cited by 35
ExaStencils: Advanced Multigrid Solver Generation
Lengauer, C., Apel, S., Bolten, M., Chiba, S., Rüde, U., Teich, J., Größlinger, A., Hannig, F., Köstler, H., Claus, L., et al. (2020) · Lecture notes in computational science and engineering · doi:10.1007/978-3-030-47956-5_14 · Cited by 36
Runtime pointer disambiguation
Alves, P., Gruber, F., Doerfert, J., Lamprineas, A., Grosser, T., Rastello, F., & Pereira, F. M. Q. (2015) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/2814270.2814285 · Cited by 38
High-Performance Generalized Tensor Operations
Gareev, R. A., Grosser, T., & Kruse, M. (2018) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3235029 · Cited by 28
Pałkowski, M., & Bielecki, W. (2017) · BMC Bioinformatics · doi:10.1186/s12859-017-1707-8 · Cited by 30
A study on popular auto‐parallelization frameworks
Prema, S., Nasre, R., Jehadeesan, R., & Panigrahi, B. K. (2019) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.5168 · Cited by 31
A Case Study on RNA-RNA Interaction Application Implementation using AlphaZ
Varadarajan, S. (2019) · doi:10.1145/3300111.3300112 · Cited by 26
TiDA: High-Level Programming Abstractions for Data Locality Management
Unat, D., Nguyen, T., Zhang, W., Farooqi, M. N., Bastem, B., Michelogiannakis, G., Almgren, A., & Shalf, J. M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-41321-1_7 · Cited by 26
Tiling arbitrarily nested loops by means of the transitive
Bielecki, W., & Pałkowski, M. (2016) · International Journal of Applied Mathematics and Computer Science · doi:10.1515/amcs-2016-0065 · Cited by 28
Complexity Estimates for Fourier-Motzkin Elimination
Jing, R.-J., Maza, M. M., & Talaashrafi, D. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-60026-6_16 · Cited by 30
Improving parallelism and locality with asynchronous algorithms
Liu, L., & Li, Z. (2010) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/1693453.1693483 · Cited by 25
Symbolic parallelization of loop programs for massively parallel processor arrays
Teich, J., Tanase, A., & Hannig, F. (2013) · IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP) · doi:10.1109/asap.2013.6567543 · Cited by 25
Reddy, C., Kruse, M., & Cohen, A. (2016) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1145/2967938.2967950 · Cited by 22
Compiler/Runtime Framework for Dynamic Dataflow Parallelization of Tiled Programs
Kong, M., Pop, A., Pouchet, L.-N., Govindarajan, R., Cohen, A., & Sadayappan, P. (2015) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/2687652 · Cited by 20
Self-citationChowdhury, R., Ganapathi, P., Tithi, J. J., Bachmeier, C., Kuszmaul, B. C., Leiserson, C. E., Solar-Lezama, A., & Tang, Y. (2016) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/2851141.2851167 · Cited by 21
Declarative Loop Tactics for Domain-specific Optimization
Chelini, L., Zinenko, O., Grosser, T., & Corporaal, H. (2019) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3372266 · Cited by 28
Tithi, J. J., Ganapathi, P., Talati, A., Aggarwal, S., & Chowdhury, R. (2015) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2015.107 · Cited by 20
Symbolic Mapping of Loop Programs onto Processor Arrays
Teich, J., Tanase, A., & Hannig, F. (2014) · Journal of Signal Processing Systems · doi:10.1007/s11265-014-0905-0 · Cited by 20
Caamaño, J. M. M., Selva, M., Clauss, P., Baloian, A., & Wolff, W. (2017) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.4192 · Cited by 23
Enhancing the Scalability of Multi-FPGA Stencil Computations via Highly Optimized HDL Components
Reggiani, E., Sozzo, E. D., Conficconi, D., Natale, G., Moroni, C., & Santambrogio, M. D. (2021) · ACM Transactions on Reconfigurable Technology and Systems · doi:10.1145/3461478 · Cited by 22
Free scheduling for statement instances of parameterized arbitrarily nested affine loops
Bielecki, W., Pałkowski, M., & Klimek, T. (2012) · Parallel Computing · doi:10.1016/j.parco.2012.06.001 · Cited by 19
NUMA Aware Iterative Stencil Computations on Many-Core Systems
Shaheen, M., & Strzodka, R. (2012) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2012.50 · Cited by 19
Mira: A Framework for Static Performance Analysis
Meng, K., & Norris, B. (2017) · IEEE International Conference on Cluster Computing (CLUSTER) · doi:10.1109/cluster.2017.43 · Cited by 20
Advancements in Compiler Design and Optimization Techniques
Maruthamuthu, R., Dhabliya, D., Kala Priyadarshini, G., Abbas, A. H. R., Barno, A., & kumar, V. V. (2023) · E3S Web of Conferences · doi:10.1051/e3sconf/202339904047 · Cited by 20
Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms
Chowdhury, R., Ganapathi, P., Tang, Y., & Tithi, J. J. (2017) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/3087556.3087586 · Cited by 17
Automatic Generation of Multi-Objective Polyhedral Compiler Transformations
Chelini, L., Gysi, T., Grosser, T., Kong, M., & Corporaal, H. (2020) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1145/3410463.3414635 · Cited by 19
A Survey of Performance Tuning Techniques and Tools for Parallel Applications
Mustafa, D. (2022) · IEEE Access · doi:10.1109/access.2022.3147846 · Cited by 18
Identifying pitfalls in automatic parallelization of NAS parallel benchmarks
Prema, S., Jehadeesan, R., & Panigrahi, B. K. (2017) · National Conference on Parallel Computing Technologies (PARCOMPTECH) · doi:10.1109/parcomptech.2017.8068329 · Cited by 15
POLSCA: Polyhedral High-Level Synthesis with Compiler Transformations
Zhao, R., Cheng, J., Luk, W. W., & Constantinides, G. A. (2022) · International Conference on Field Programmable Logic and Applications (FPL) · doi:10.1109/fpl57034.2022.00044 · Cited by 19
Pencil: A Pipelined Algorithm for Distributed Stencils
Wang, H., & Chandramowlishwaran, A. M. (2020) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41405.2020.00089 · Cited by 18
Chowdhury, R., Ganapathi, P., Tschudi, S. L., Tithi, J. J., Bachmeier, C., Leiserson, C. E., Solar-Lezama, A., Kuszmaul, B. C., & Tang, Y. (2017) · ACM Transactions on Parallel Computing · doi:10.1145/3125632 · Cited by 17
Stawinoga, N., & Field, T. (2018) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3194242 · Cited by 17
Accelerating High-Order Stencils on GPUs
Sai, R., Mellor‐Crummey, J., Meng, X., Araya–Polo, M., & Meng, J. (2020) · IEEE/ACM International Workshop on Performance Modeling, Benchmarking and Simulation of High Performance Computer Systems (PMBS) · doi:10.1109/pmbs51919.2020.00014 · Cited by 17
Efficient automatic scheduling of imaging and vision pipelines for the GPU
Anderson, L., Adams, A., Ma, K., Li, T., Tian, J. W., & Ragan‐Kelley, J. (2021) · Proceedings of the ACM on Programming Languages · doi:10.1145/3485486 · Cited by 33
Malas, T. M., Hornich, J., Hager, G., Ltaief, H., Pflaum, C., & Keyes, D. E. (2016) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2016.87 · Cited by 13
Towards parallelism detection of sequential programs with graph neural network
Shen, Y., Peng, M., Wang, S., & Wu, Q. (2021) · Future Generation Computer Systems · doi:10.1016/j.future.2021.07.001 · Cited by 13
Positivity, posynomials and tile size selection
Renganarayana, L., & Rajopadhye, S. V. (2008) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc.2008.5213293 · Cited by 13
Tuning iteration space slicing based tiled multi-core code implementing Nussinov’s RNA folding
Pałkowski, M., & Bielecki, W. (2018) · BMC Bioinformatics · doi:10.1186/s12859-018-2008-6 · Cited by 12
Bielecki, W., & Pałkowski, M. (2015) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-15147-2_26 · Cited by 13
Separation Logic for High-Level Synthesis
Winterstein, F., Bayliss, S., & Constantinides, G. A. (2015) · ACM Transactions on Reconfigurable Technology and Systems · doi:10.1145/2836169 · Cited by 16
Tiling as a Durable Abstraction for Parallelism and Data Locality
Unat, D., Chan, C. P., Zhang, W., Bell, J. T., & Shalf, J. M. (2013) · eScholarship (California Digital Library) · Cited by 11
A review of CUDA optimization techniques and tools for structured grid computing
Al-Mouhamed, M. A., Khan, A. H., & Mohammad, N. (2019) · Computing · doi:10.1007/s00607-019-00744-1 · Cited by 13
A Review of Parallelization Tools and Introduction to Easypar
Sah, S., & Vaidya, V. G. (2012) · International Journal of Computer Applications · doi:10.5120/8944-3108 · Cited by 20
Arabnejad, H., Bispo, J., Barbosa, J. G., & Cardoso, J. M. P. (2018) · doi:10.1145/3183767.3183770 · Cited by 11
IOOpt: automatic derivation of I/O complexity bounds for affine programs
Olivry, A., Iooss, G., Tollenaere, N., Rountev, A., Sadayappan, P., & Rastello, F. (2021) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3453483.3454103 · Cited by 17
Self-citationFPL: fast Presburger arithmetic through transprecision
Pitchanathan, A., Ulmann, C., Weber, M., Hoefler, T., & Grosser, T. (2021) · Proceedings of the ACM on Programming Languages · doi:10.1145/3485539 · Cited by 16
Yang, P., Dong, F., Codreanu, V., Williams, D., Roerdink, J. B. T. M., Liu, B., Anvari‐Moghaddam, A., & Min, G. (2017) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2017.2731362 · Cited by 9
Tiling Nussinov’s RNA folding loop nest with a space-time approach
Pałkowski, M., & Bielecki, W. (2019) · BMC Bioinformatics · doi:10.1186/s12859-019-2785-6 · Cited by 10
Kelefouras, V. I., & Djemame, K. (2019) · The Journal of Supercomputing · doi:10.1007/s11227-019-02880-z · Cited by 10
Polyhedral-Based Compilation Framework for In-Memory Neural Network Accelerators
Han, J., Fei, X., Li, Z., & Zhang, Y. (2021) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3469847 · Cited by 13
A Survey on Parallelism and Determinism
Gonnord, L., Henrio, L., Morel, L., & Radanne, G. (2023) · ACM Computing Surveys · doi:10.1145/3564529 · Cited by 22
Combining Software Cache Partitioning and Loop Tiling for Effective Shared Cache Management
Kelefouras, V. I., Κεραμίδας, Γ., & Voros, N. S. (2018) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3202663 · Cited by 10
Asynchronous computations for solving the acoustic wave propagation equation
Akbudak, K., Ltaief, H., Etienne, V., Abdelkhalak, R., Tonellot, T., & Keyes, D. E. (2020) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342020923027 · Cited by 10
Automatic Generation of Distributed-Memory Mappings for Tensor Computations
Kong, M., Abu-Yosef, R., Rountev, A., & Sadayappan, P. (2023) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3581784.3607096 · Cited by 9
Self-citationJavanmard, M. M., Ahmad, Z., Kong, M., Pouchet, L.-N., Chowdhury, R., & Harrison, R. J. (2020) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/3368826.3377916 · Cited by 9
Automatic Parallel Tiled Code Generation Based on Dependence Approximation
Bielecki, W., & Poliwoda, M. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-86359-3_20 · Cited by 9
Towards intelligent compiler optimization
Kovač, M., Brčić, M., Krajna, A., & Krleža, D. (2022) · International Convention on Information and Communication Technology, Electronics and Microelectronics · doi:10.23919/mipro55190.2022.9803630 · Cited by 9
From Serial Loops to Parallel Execution on Distributed Systems
Bosilca, G., Bouteiller, A., Anthony Danalis, A., Thomas Herault, A., & Dongarra, J. J. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32820-6_25 · Cited by 10
Automatic Parameter Tuning of Three-Dimensional Tiled FDTD Kernel
Minami, T., Motoharu, H., Hiraishi, T., Iwashita, T., & Nakashima, H. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-17353-5_24 · Cited by 9
Tile size selection for optimized memory reuse in high-level synthesis
Liu, J., Wickerson, J., & Constantinides, G. A. (2017) · International Conference on Field Programmable Logic and Applications (FPL) · doi:10.23919/fpl.2017.8056810 · Cited by 16
Insight into tiles generated by means of a correction technique
Bielecki, W., & Skotnicki, P. (2018) · The Journal of Supercomputing · doi:10.1007/s11227-018-2678-x · Cited by 9
PWCET: Power-Aware Worst Case Execution Time Analysis
Bao, W., Tavarageri, S., Özgüner, F., & Sadayappan, P. (2014) · International Conference on Parallel Processing Workshops (ICPPW) · doi:10.1109/icppw.2014.64 · Cited by 8
Self-citationAsynchronous Task-Based Execution of the Reverse Time Migration for the Oil and Gas Industry
AlOnazi, A., Ltaief, H., Keyes, D. E., Saïd, I., & Thibault, S. (2019) · IEEE International Conference on Cluster Computing (CLUSTER) · doi:10.1109/cluster.2019.8891054 · Cited by 8
Automated Code Generation of High-Order Stencils for a Dataflow Architecture
Sai, R., Mellor‐Crummey, J., Xu, J., & Araya‐Polo, M. (2024) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41406.2024.00025 · Cited by 13
Data locality and parallelism optimization using a constraint-based approach
Öztürk, Ö. (2010) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2010.08.005 · Cited by 8
Automatic OpenCL Code Generation from LLVM-IR using Polyhedral Optimization
Kalms, L., Hebbeler, T., & Göhringer, D. (2018) · doi:10.1145/3183767.3183779 · Cited by 9
Transparent Acceleration for Heterogeneous Platforms With Compilation to OpenCL
Riebler, H., Vaz, G., Kenter, T., & Plessl, C. (2019) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3319423 · Cited by 9
NPDP benchmark suite for the evaluation of the effectiveness of automatic optimizing compilers
Pałkowski, M., & Bielecki, W. (2023) · Parallel Computing · doi:10.1016/j.parco.2023.103016 · Cited by 7
GPU code optimization using abstract kernel emulation and sensitivity analysis
Hong, C., Sukumaran-Rajam, A., Kim, J., Rawat, P. S., Krishnamoorthy, S., Pouchet, L.-N., Rastello, F., & Sadayappan, P. (2018) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3192366.3192397 · Cited by 7
Self-citationParallel Tiled Codes Implementing the Smith–Waterman Alignment Algorithm for Two and Three Sequences
Pałkowski, M., & Bielecki, W. (2018) · Journal of Computational Biology · doi:10.1089/cmb.2018.0006 · Cited by 8
Code Generation for In-Place Stencils
Essadki, M., Michel, B., Maugars, B., Zinenko, O., Vasilache, N., & Cohen, A. (2023) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/3579990.3580006 · Cited by 7
Pałkowski, M., & Bielecki, W. (2015) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-15147-2_34 · Cited by 8
Time-space tiling with tile-level parallelism for the 3D FDTD method
Fukaya, T., & Iwashita, T. (2018) · International Conference on High Performance Computing in Asia-Pacific Region (HPC Asia) · doi:10.1145/3149457.3149478 · Cited by 7
Accelerating high‐order stencils on GPUs
Sai, R., Mellor‐Crummey, J., Meng, X., Zhou, K., Araya–Polo, M., & Meng, J. (2021) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.6467 · Cited by 16
LOOPer: A Learned Automatic Code Optimizer For Polyhedral Compilers
Merouani, M., Boudaoud, A., Aouadj, I. N., Tchoulak, N., Bernou, I. K., Benyamina, H., Tayeb, F. B.-S., Benatchba, K., Leather, H., & Baghdadi, R. (2025) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1109/pact65351.2025.00028 · Cited by 21
LegUp-NoC: High-Level Synthesis of Loops with Indirect Addressing
Islam, A., & Kapre, N. (2018) · IEEE International Symposium on Field-Programmable Custom Computing Machines (FCCM) · doi:10.1109/fccm.2018.00027 · Cited by 6
Strzodka, R., Shaheen, M., & Pająk, D. (2011) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/1941553.1941596 · Cited by 6
Metadata
- Authors
- Bondhugula, U., Hartono, A., Ramanujam, J., & Sadayappan, P.
- Affiliations
- The Ohio State University (US)
- Louisiana State University (US)
- Venue
- ACM SIGPLAN Notices
- Published
- 2008-05-30
- Volume
- 43
- Issue
- 6
- Pages
- 101-113
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W3151489216
- Cited by
- 248
- References
- 41
- Citations by year
- 2026: 13 · 2025: 11 · 2024: 7 · 2023: 15 · 2022: 16 · 2021: 25 · 2020: 19 · 2019: 19 · 2018: 28 · 2017: 24 · 2016: 18 · 2015: 13 · 2014: 9 · 2013: 8 · 2012: 9
- FWCI
- 9.67
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- ACM SIGPLAN Notices (publishedVersion)
- Civil War Book Review (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
- Keywords
- polyhedral models, automatic parallelization, locality optimization, source-to-source translation, loop tiling, integer linear programming, affine transformation, nested loops, compiler optimization
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.