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
Items 101–200 of 249
Mendonça, G. S. D., Liao, C., & Pereira, F. M. Q. (2020) · International Conference on Supercomputing · doi:10.1145/3392717.3392744 · Cited by 6
To Pack or Not to Pack: A Generalized Packing Analysis and Transformation
Rohwedder, C. S., Henderson, N., de Carvalho, J. P. L., Chen, Y., & Amaral, J. N. (2023) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/3579990.3580024 · Cited by 10
RT-CUDA: A Software Tool for CUDA Code Restructuring
Khan, A. H., Al-Mouhamed, M. A., Al-Mulhem, M. S., & Ahmed, A. F. (2016) · International Journal of Parallel Programming · doi:10.1007/s10766-016-0433-6 · Cited by 6
Magomedov, S. G., & Lebedev, A. S. (2019) · Russian Technological Journal · doi:10.32362/2500-316x-2019-7-5-7-19 · Cited by 7
Herzeel, C., & Costanza, P. (2010) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/1869459.1869491 · Cited by 7
Cross-platform and polyhedral programming for Nussinov RNA folding
Grużewski, M., & Pałkowski, M. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107786 · Cited by 8
YAO: A Generator of Parallel Code for Variational Data Assimilation Applications
Nardi, L., Badran, F., Pierre, F., & Thiria, S. (2012) · IEEE International Conference on High Performance Computing and Communications; IEEE International Conference on Smart City; IEEE International Conference on Data Science and Systems (HPCC/SmartCity/DSS) · doi:10.1109/hpcc.2012.38 · Cited by 5
Mapping Optimization of Affine Loop Nests for Reconfigurable Computing Architecture
Liu, D., Yin, S., Yin, C., Liu, L., & Wei, S. (2012) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.e95.d.2898 · Cited by 5
Exploiting temporal data reuse and asynchrony in the reverse time migration
Qu, L., Abdelkhalak, R., Ltaief, H., Saïd, I., & Keyes, D. E. (2022) · The International Journal of High Performance Computing Applications · doi:10.1177/10943420221128529 · Cited by 6
Automatic Evolution of Parallel Recursive Programs
Chennupati, G., Azad, R. M. A., & Ryan, C. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-16501-1_14 · Cited by 5
Generation of parallel synchronization-free tiled code
Bielecki, W., Pałkowski, M., & Skotnicki, P. (2017) · Computing · doi:10.1007/s00607-017-0576-3 · Cited by 6
Visual Program Manipulation in the Polyhedral Model
Zinenko, O., Huot, S., & Bastoul, C. (2018) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3177961 · Cited by 10
Parallel cache-efficient code for computing the McCaskill partition functions
Pałkowski, M., & Bielecki, W. (2019) · Annals of Computer Science and Information Systems · doi:10.15439/2019f8 · Cited by 5
Lifting Barriers Using Parallel Polyhedral Regions
Razanajato, H., Bastoul, C., & Loechner, V. (2017) · IEEE International Conference on High Performance Computing, Data, and Analytics · doi:10.1109/hipc.2017.00046 · Cited by 7
LLVM Based Parallelization of C Programs for GPU
Катаев, Н. А. (2020) · Communications in computer and information science · doi:10.1007/978-3-030-64616-5_38 · Cited by 6
Optimizing Dynamic Resource Allocation
Krakow, L. W., Rabiet, L., Zou, Y., Iooss, G., Chong, E. K. P., & Rajopadhye, S. V. (2014) · Procedia Computer Science · doi:10.1016/j.procs.2014.05.115 · Cited by 5
Communication Papers of the 2018 Federated Conference on Computer Science and Information Systems
(2018) · Annals of Computer Science and Information Systems · doi:10.15439/978-83-952357-0-2 · Cited by 5
New Approach to Speedup Dynamic Program Parallelization Analysis
Sah, S., & Vaidya, V. G. (2014) · International Journal of Software Innovation · doi:10.4018/ijsi.2014100103 · Cited by 4
Towards a Semantics-Aware Code Transformation Toolchain for Heterogeneous Systems
Tamarit, S., Mariño, J., Vigueras, G., & Carro, M. (2017) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.237.3 · Cited by 4
Additional Parallelization of Existing MPI Programs Using SAPFOR
Катаев, Н. А., & Kolganov, A. S. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-86359-3_4 · Cited by 5
Using the Semi-Stencil Algorithm to Accelerate High-Order Stencils on GPUs
Sai, R., Mellor‐Crummey, J., Meng, X., Araya–Polo, M., & Meng, J. (2021) · IEEE/ACM International Workshop on Performance Modeling, Benchmarking and Simulation of High Performance Computer Systems (PMBS) · doi:10.1109/pmbs54543.2021.00012 · Cited by 4
Time and Energy Benefits of Using Automatic Optimization Compilers for NPDP Tasks
Pałkowski, M., & Grużewski, M. (2023) · Electronics · doi:10.3390/electronics12173579 · Cited by 4
Locality-Conscious Nested-Loops Parallelization
Parsa, S. A., & Hamzei, M. (2014) · ETRI Journal · doi:10.4218/etrij.13.0113.0266 · Cited by 4
Using Free Scheduling for Programming Graphic Cards
Bielecki, W., & Pałkowski, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30397-5_7 · Cited by 4
Autotuning divide‐and‐conquer stencil computations
Natarajan, E. P., Dehnavi, M. M., & Leiserson, C. E. (2017) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.4127 · Cited by 4
DeLICM: scalar dependence removal at zero memory cost
Kruse, M., & Grosser, T. (2018) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/3168815 · Cited by 4
On the Impact of Affine Loop Transformations in Qubit Allocation
Kong, M. (2021) · ACM Transactions on Quantum Computing · doi:10.1145/3465409 · Cited by 6
Chowdhury, R., Ganapathi, P., Tithi, J. J., Bachmeier, C., Kuszmaul, B. C., Leiserson, C. E., Solar-Lezama, A., & Tang, Y. (2016) · ACM SIGPLAN Notices · doi:10.1145/3016078.2851167 · Cited by 4
Run fast when you can: Loop pipelining with uncertain and non-uniform memory dependencies
Liu, J., Wickerson, J., Bayliss, S., & Constantinides, G. A. (2017) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2017.8335151 · Cited by 4
An OpenMP Based Parallelization Compiler for C Applications
Arabnejad, H., Bispo, J., Barbosa, J. G., & Cardoso, J. M. P. (2018) · IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA) · doi:10.1109/bdcloud.2018.00135 · Cited by 4
Optimizing inter-nest data locality in imperfect stencils based on loop blocking
Seyfari, Y., Lotfi, S., & Karimpour, J. (2018) · The Journal of Supercomputing · doi:10.1007/s11227-018-2443-1 · Cited by 4
A methodology for efficient code optimizations and memory management
Kelefouras, V. I., & Djemame, K. (2018) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/3203217.3203274 · Cited by 4
Runtime pointer disambiguation
Alves, P., Gruber, F., Doerfert, J., Lamprineas, A., Grosser, T., Rastello, F., & Pereira, F. M. Q. (2015) · ACM SIGPLAN Notices · doi:10.1145/2858965.2814285 · Cited by 4
Optimizing the Linear Fascicle Evaluation Algorithm for Multi-core and Many-core Systems
Aggarwal, K., & Bondhugula, U. K. R. (2020) · ACM Transactions on Parallel Computing · doi:10.1145/3418075 · Cited by 5
Self-citationOptimization of Triangular and Banded Matrix Operations Using 2d-Packed Layouts
Baroudi, T., Seghir, R., & Loechner, V. (2017) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3162016 · Cited by 3
Automatic Parallelization of Affine Programs for Distributed Memory Systems
Lebedev, A. S., & Magomedov, S. G. (2021) · Communications in computer and information science · doi:10.1007/978-981-16-1483-5_9 · Cited by 3
Adaptive Mapping and Parameter Selection Scheme to Improve Automatic Code Generation for GPUs
Juega, J. C., Gómez, J. I., Tenllado, C., & Catthoor, F. (2014) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/2581122.2544145 · Cited by 3
Communication-Avoiding Optimizations for Large-Scale Unstructured-Mesh Applications with OP2
Ekanayake, S. D., Reguly, I. Z., Luporini, F., & Mudalige, G. R. (2023) · Proceedings of the International Conference on Parallel Processing · doi:10.1145/3605573.3605604 · Cited by 3
Parallel tiled cache and energy efficient codes for O(n4) RNA folding algorithms
Pałkowski, M., & Bielecki, W. (2019) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2019.12.007 · Cited by 3
AutoParallel: Automatic parallelisation and distributed execution of affine loop nests in Python
Ramon-Cortes, C., Amela, R., Ejarque, J., Clauss, P., & Badia, R. M. (2020) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342020937050 · Cited by 4
Distributing and Parallelizing Non-canonical Loops
Aubert, C., Rubiano, T., Rusch, N., & Seiller, T. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-24950-1_1 · Cited by 3
Automatic code optimization for computing the McCaskill partition functions
Bielecki, W., Pałkowski, M., & Poliwoda, M. (2022) · Annals of Computer Science and Information Systems · doi:10.15439/2022f4 · Cited by 3
Type‐driven data layouts for improved vectorisation
Šinkarovs, A., & Scholz, S. (2015) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.3501 · Cited by 3
HPA: An opportunistic approach to embedded energy efficiency
Delporte, B., Rigamonti, R., & Dassatti, A. (2016) · International Conference on High Performance Computing & Simulation (HPCS) · doi:10.1109/hpcsim.2016.7568415 · Cited by 3
Accelerating Minimum Cost Polygon Triangulation Code with the TRACO Compiler
Pałkowski, M., & Bielecki, W. (2018) · Annals of Computer Science and Information Systems · doi:10.15439/2018f8 · Cited by 3
swATOP: Automatically Optimizing Deep Learning Operators on SW26010 Many-Core Processor
Gao, W. J., Fang, J., Zhao, W., Yang, J., Wang, L., Gan, L., Fu, H., & Yang, G. (2019) · Proceedings of the International Conference on Parallel Processing · doi:10.1145/3337821.3337883 · Cited by 3
Pure Functions in C: A Small Keyword for Automatic Parallelization
Süß, T., Nagel, L., Vef, M.-A., Brinkmann, A., Feld, D., & Soddemann, T. (2020) · International Journal of Parallel Programming · doi:10.1007/s10766-020-00660-4 · Cited by 3
A predictable hardware to exploit temporal reuse in real-time and embedded systems
Tejero, R. G., Segarra, J., Pedro-Zapater, A., Aparicio, L. C., Viñals, V., & Rodríguez, C. (2015) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2015.05.001 · Cited by 3
An Analytical Model for Loop Tiling Transformation
Kelefouras, V. I., Djemame, K., Κεραμίδας, Γ., & Voros, N. S. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-04580-6_7 · Cited by 3
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 Notices · doi:10.1145/3296979.3192397 · Cited by 3
Self-citationA Methodology for Efficient Tile Size Selection for Affine Loop Kernels
Kelefouras, V. I., Djemame, K., Κεραμίδας, Γ., & Voros, N. S. (2022) · International Journal of Parallel Programming · doi:10.1007/s10766-022-00734-5 · Cited by 3
YaskSite: Stencil Optimization Techniques Applied to Explicit ODE Methods on Modern Architectures
Alappat, C. L., Seiferth, J., Hager, G., Korch, M., Rauber, T., & Wellein, G. (2021) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo51591.2021.9370316 · Cited by 4
Chelini, L., Kong, M., Grosser, T., & Corporaal, H. (2021) · International Workshop on Software and Compilers for Embedded Systems (SCOPES) · doi:10.1145/3493229.3493301 · Cited by 2
Dynamic Loop Fusion in High-Level Synthesis
Szafarczyk, R., Nabi, S. W., & Vanderbauwhede, W. A. (2025) · ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA) · doi:10.1145/3706628.3708871 · Cited by 2
Rec2Poly: Converting Recursions to Polyhedral Optimized Loops Using an Inspector-Executor Strategy
Kobeissi, S., Ketterlin, A., & Clauss, P. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-60939-9_7 · Cited by 2
Automation of program parallelization in SAPFOR
Катаев, Н. А., & Chernykh, S. A. (2020) · Naučnyj servis v seti internet · doi:10.20948/abrau-2020-24 · Cited by 2
Adaptive Mapping and Parameter Selection Scheme to Improve Automatic Code Generation for GPUs
Juega, J. C., Gómez, J. I., Tenllado, C., & Catthoor, F. (2014) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/2544137.2544145 · Cited by 2
Invasive Tightly Coupled Processor Arrays
Lari, V. (2016) · Computer architecture and design methodologies · doi:10.1007/978-981-10-1058-3 · Cited by 2
Finding Free Schedules for RNA Secondary Structure Prediction
Pałkowski, M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-39384-1_16 · Cited by 2
Automatic instruction-set architecture synthesis for VLIW processor cores in the ASAM project
Jordans, R., Jóźwiak, L., Corporaal, H., & Corvino, R. (2017) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2017.04.011 · Cited by 3
Pałkowski, M., & Bielecki, W. (2017) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-67229-8_18 · Cited by 2
Optimizing Numerical Code by means of the Transitive Closure of Dependence Graphs
Pałkowski, M., & Bielecki, W. (2017) · Annals of Computer Science and Information Systems · doi:10.15439/2017f19 · Cited by 2
Improving parallelism and locality with asynchronous algorithms
Liu, L., & Li, Z. (2010) · ACM SIGPLAN Notices · doi:10.1145/1837853.1693483 · Cited by 2
Temporal blocking of finite-difference stencil operators with sparse “off-the-grid” sources
Bisbas, G., Luporini, F., Louboutin, M., Nelson, R. B., Gorman, G., & Kelly, P. H. J. (2021) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps49936.2021.00058 · Cited by 2
Beyond reuse distance analysis
Fauzia, N., Elango, V., Ravishankar, M., Ramanujam, J., Rastello, F., Rountev, A., Pouchet, L.-N., & Sadayappan, P. (2013) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/2555289.2555309 · Cited by 2
Self-citationEmploying Polyhedral Methods to Reduce Data Movement in FPGA Stencil Codes
Mayer, F., Brandner, J., & Philippsen, M. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-31445-2_4 · Cited by 2
Energy efficient computing by using of software optimization aimed on execution time
Chemerys, O., & Sushko, S. (2023) · IOP Conference Series Earth and Environmental Science · doi:10.1088/1755-1315/1254/1/012037 · Cited by 2
Parallel Tiled Cache and Energy Efficient Code for Zuker’s RNA Folding
Pałkowski, M., & Bielecki, W. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-43222-5_3 · Cited by 2
RNA Folding Codes Optimization Using the Intel SDK for OpenCL
Grużewski, M., & Pałkowski, M. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-87897-9_42 · Cited by 2
Parallel Data Reuse Theory for OpenMP Applications
Wu, J., Pan, X., Liu, G., Zhang, B., & Yang, X. (2009) · ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) · doi:10.1109/snpd.2009.92 · Cited by 2
Cooper, K. D., & Torczon, L. (2022) · Elsevier eBooks · doi:10.1016/b978-0-12-815412-0.00007-3 · Cited by 1
Efficiency of Various Tiling Strategies for the Zuker Algorithm Optimization
Błaszyński, P., Pałkowski, M., Bielecki, W., & Poliwoda, M. (2024) · Mathematics · doi:10.3390/math12050728 · Cited by 1
Verified Validation for Affine Scheduling in Polyhedral Compilation
Li, X., Liang, H., & Feng, X. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-64626-3_17 · Cited by 1
STCO: Enhancing Training Efficiency via Structured Sparse Tensor Compilation Optimization
Huang, S., Liu, F., Li, T., Wang, Z., Yang, N., Li, H., & Jiang, L. (2024) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/3701033 · Cited by 2
A Taxonomy of the High-Level Synthesis Ecosystem for Heterogeneous FPGA Systems
Gottschaldt, P., Podlubne, A., & Göhringer, D. (2025) · ACM Transactions on Reconfigurable Technology and Systems · doi:10.1145/3764664 · Cited by 5
Agentic Auto-Scheduling: An Experimental Study of LLM-Guided Loop Optimization
Merouani, M., Bernou, I. K., & Baghdadi, R. (2025) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1109/pact65351.2025.00027 · Cited by 12
LEGO: A Layout Expression Language for Code Generation of Hierarchical Mapping
Tavakkoli, A. M., Oancea, C. E., & Hall, M. W. (2026) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo68049.2026.11394846 · Cited by 4
LOOPRAG: Enhancing Loop Transformation Optimization with Retrieval-Augmented Large Language Models
Zhi, Y., Cao, Y., Dai, J., Han, X., Pu, J., Wu, Q., Cheng, S., & Cai, M. (2026) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3779212.3790183 · Cited by 1
Cache-efficient and vectorized parallel dynamic programming for RNA folding
Grużewski, M., & Pałkowski, M. (2026) · PLoS ONE · doi:10.1371/journal.pone.0349146 · Cited by 1
Affine transformations for communication and reconfiguration optimization of loops on CGRAs
Liu, D., Yin, S., Liu, L., & Wei, S. (2013) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2013.6572396 · Cited by 1
An Effective Framework of Program Optimization for High Performance Computing
Lu, P., Li, B., Pang, Z., Zhang, Y., Wang, S., Xu, J., & Liu, Y. (2013) · Communications in computer and information science · doi:10.1007/978-3-642-41635-4_16 · Cited by 1
An approach of processor core customization for stencil computation
Li, Y., Zhang, Y., Yang, J., Luk, W. W., Yang, G., & Zheng, W. (2014) · IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP) · doi:10.1109/asap.2014.6868656 · Cited by 1
Loop Nest Tiling for Image Processing and Communication Applications
Bielecki, W., & Pałkowski, M. (2016) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-48429-7_28 · Cited by 1
Improving Data Locality of RNA Secondary Structure Prediction Code
Pałkowski, M., Bielecki, W., & Skotnicki, P. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59063-9_62 · Cited by 1
A high‐level library for multidimensional arrays programming in computational science
Chakroun, I., Aa, T. V., Fraine, B. D., Haber, T., Costanza, P., & Wuyts, R. (2018) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.4376 · Cited by 1
A language extension set to generate adaptive versions automatically
Schmitt, M., Bastoul, C., & Helluy, P. (2018) · Oil & Gas Science and Technology – Revue d’IFP Energies nouvelles · doi:10.2516/ogst/2018049 · Cited by 2
Memory-Access-Pattern Analysis Techniques for OpenCL Kernels
Jo, G., Jung, J., Park, J., & Lee, J. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-35225-7_9 · Cited by 1
Strzodka, R., Shaheen, M., & Pająk, D. (2011) · ACM SIGPLAN Notices · doi:10.1145/2038037.1941596 · Cited by 1
Invasive Tightly Coupled Processor Arrays
Lari, V. (2016) · Computer architecture and design methodologies · doi:10.1007/978-981-10-1058-3_2 · Cited by 1
ReAAP: A Reconfigurable and Algorithm-Oriented Array Processor with Compiler-Architecture Co-Design
Zheng, J., Liu, Y., Liu, X., Liang, L., Chen, D., & Cheng, K.-T. T. (2022) · IEEE Transactions on Computers · doi:10.1109/tc.2022.3213177 · Cited by 2
Automation of Programming for Promising High-Performance Computing Systems
Бахтин, В. А., Zakharov, D. A., Катаев, Н. А., Kolganov, A. S., & Yakobovskiy, M. V. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-41673-6_1 · Cited by 1
Building a domain-specific compiler for emerging processors with a reusable approach
Li, M., Liu, Y., Chen, B., Yang, H., Luan, Z., & Qian, D. (2023) · Science China Information Sciences · doi:10.1007/s11432-022-3727-6 · Cited by 1
LLM-Driven Cross-Platform Code Generation for Polyhedral Optimized NPDP Codes
Pałkowski, M. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-85700-3_12 · Cited by 2
Lebedev, A. S. (2017) · IEEE International Conference on Application of Information and Communication Technologies (AICT) · doi:10.1109/icaict.2017.8686931 · Cited by 1
Automatic Generation of Parallel Cache-Efficient Code Implementing Zuker’s RNA Folding
Pałkowski, M., Bielecki, W., & Grużewski, M. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-61401-0_60 · Cited by 1
Source to source compiler for the automatic parallelization of JavaScript code
Diaz-Baskakov, S., & Gutiérrez-Cárdenas, J. M. (2021) · IEEE International Conference on Electronics, Electrical Engineering and Computing (INTERCON) · doi:10.1109/intercon52678.2021.9532645 · Cited by 1
Additional parallelization of existing MPI programs using SAPFOR
Катаев, Н. А., & Kolganov, A. S. (2021) · Vyčislitelʹnye metody i programmirovanie · doi:10.26089/nummet.v22r415 · Cited by 1
Parallelism Detection Using Graph Labelling
Telegin, P., Викторович, Б. А., Шабанов, Б. М., & Игоревич, Т. А. (2022) · Lobachevskii Journal of Mathematics · doi:10.1134/s199508022213042x · Cited by 1
NPDP Benchmark Suite for Loop Tiling Effectiveness Evaluation
Pałkowski, M., & Bielecki, W. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-30445-3_5 · Cited by 1
Dynamic parallelization of recursive code
Herzeel, C., & Costanza, P. (2010) · ACM SIGPLAN Notices · doi:10.1145/1932682.1869491 · Cited by 1
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.