Code generation in the polyhedral model is easier than you think
Open accessThe DOI matches its Crossref record; 28 of the 30 references it cites were found in a registry or an index.
Abstract
Many advances in automatic parallelization and optimization have been achieved through the polyhedral model. It has been extensively shown that this computational model provides convenient abstractions to reason about and apply program transformations. Nevertheless, the complexity of code generation has long been a deterrent for using polyhedral representation in optimizing compilers. First, code generators have a hard time coping with generated code size and control overhead that may spoil theoretical benefits achieved by the transformations. Second, this step is usually time consuming, hampering the integration of the polyhedral framework in production compilers or feedback-directed, iterative optimization schemes. Moreover, current code generation algorithms only cover a restrictive set of possible transformation functions. This paper discusses a general transformation framework able to deal with nonunimodular, noninvertible, nonintegral or even nonuniform functions. It presents several improvements to a state-of-the-art code generation algorithm. Two directions are explored: generated code size and code generator efficiency. Experimental evidence proves the ability of the improved method to handle real-life problems.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Automatic discovery of linear restraints among variables of a program
Cousot, P., & Halbwachs, N. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512770 · Cited by 1,614
Dataflow analysis of array and scalar references
Feautrier, P. (1991) · International Journal of Parallel Programming · doi:10.1007/bf01407931 · Cited by 567
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
The Structure of Computers and Computations
Kuck, D. L. (1978) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 492
Parametric integer programming
Feautrier, P. (1988) · RAIRO - Operations Research · doi:10.1051/ro/1988220302431 · Cited by 378
Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time
Feautrier, P. (1992) · International Journal of Parallel Programming · doi:10.1007/bf01379404 · Cited by 368
Scanning polyhedra with DO loops
Ancourt, C., & Irigoin, F. (1991) · Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/109625.109631 · Cited by 315
A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
WILDE, D. K. (2000) · Parallel Algorithms and Applications · doi:10.1080/01495730008947354 · Cited by 198
Generation of Efficient Nested Loops from Polyhedra
Quilleré, F., Rajopadhye, S., & Wilde, D. (2000) · International Journal of Parallel Programming · doi:10.1023/a:1007554627716 · Cited by 161
Research works printed but not linked: 2
- le fur, 1994, Parcours de polye?dres parame?tre?s avec l'e?limination de Fourier-Motzkin, Technical Report, 2358
- slama, 2000, Vers l'extension du mode?le polye?drique aux transformations irre?gulie?res, CARI'5 International Conference on African Research in Computer Science
Cited by
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
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
Tensor 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
POLLY — PERFORMING POLYHEDRAL OPTIMIZATIONS ON A LOW-LEVEL INTERMEDIATE REPRESENTATION
GROSSER, T., GROESSLINGER, A., & LENGAUER, C. (2012) · Parallel Processing Letters · doi:10.1142/s0129626412500107 · Cited by 355
isl: An Integer Set Library for the Polyhedral Model
Verdoolaege, S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15582-6_49 · Cited by 334
MLIR: A Compiler Infrastructure for the End of Moore's LawPreprint
Lattner, C., Amini, M., Bondhugula, U. K. R., Cohen, A., Davis, A., Pienaar, J. A., Riddle, R., Shpeisman, T., Vasilache, N., & Zinenko, O. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.11054 · Cited by 417
Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code
Baghdadi, R., Ray, J., Romdhane, M. B., Sozzo, E. D., Akkas, A., Zhang, Y., Suriana, P., Kamil, S., & Amarasinghe, S. (2019) · 2019 IEEE/ACM International Symposium on Code Generation and Optimization (CGO) · doi:10.1109/cgo.2019.8661197 · Cited by 182
The Polyhedral Model Is More Widely Applicable Than You Think
Benabderrahmane, M.-W., Pouchet, L.-N., Cohen, A., & Bastoul, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11970-5_16 · Cited by 232
Self-citationA practical automatic polyhedral parallelizer and locality optimizer
Bondhugula, U., Hartono, A., Ramanujam, J., & Sadayappan, P. (2008) · ACM SIGPLAN Notices · doi:10.1145/1379022.1375595 · Cited by 248
Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies
Girbal, S., Vasilache, N., Bastoul, C., Cohen, A., Parello, D., Sigler, M., & Temam, O. (2006) · International Journal of Parallel Programming · doi:10.1007/s10766-006-0012-3 · Cited by 215
Self-citationA compiler framework for optimization of affine loop nests for gpgpus
Baskaran, M. M., Bondhugula, U., Krishnamoorthy, S., Ramanujam, J., Rountev, A., & Sadayappan, P. (2008) · Proceedings of the 22nd annual international conference on Supercomputing · doi:10.1145/1375527.1375562 · Cited by 216
Bondhugula, U., Baskaran, M., Krishnamoorthy, S., Ramanujam, J., Rountev, A., & Sadayappan, P. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78791-4_9 · Cited by 196
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
Automatic C-to-CUDA Code Generation for Affine Programs
Baskaran, M. M., Ramanujam, J., & Sadayappan, P. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11970-5_14 · Cited by 204
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
Polyhedral-based data reuse optimization for configurable computing
Pouchet, L.-N., Zhang, P., Sadayappan, P., & Cong, J. (2013) · Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays · doi:10.1145/2435264.2435273 · Cited by 162
PolyMage: Automatic Optimization for Image Processing Pipelines
Mullapudi, R. T., Vasista, V., & Bondhugula, U. (2015) · Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/2694344.2694364 · Cited by 160
Iterative optimization in the polyhedral model: part ii, multidimensional time
Pouchet, L.-N., Bastoul, C., Cohen, A., & Cavazos, J. (2008) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1375581.1375594 · Cited by 147
Self-citationpn: A Tool for Improved Derivation of Process Networks
Verdoolaege, S., Nikolov, H., & Stefanov, T. P. (2007) · EURASIP Journal on Embedded Systems · doi:10.1186/1687-3963-2007-075947 · Cited by 146
Polly – Polyhedral optimization in LLVM
Grosser, T., Zheng, H., Aloor, R., Simbürger, A., Größlinger, A., & Pouchet, L.-N. (2012) · Cited by 127
Proceedings of the GCC Developers' Summit
Fursin, G., Miranda, C., Temam, O., Namolaru, M., Yom‐Tov, E., Zaks, A., Mendelson, B., Bonilla, E. V., Thomson, J. D., Leather, H., et al. (2008) · Cited by 123
When polyhedral transformations meet SIMD code generation
Kong, M., Veras, R., Stock, K., Franchetti, F., Pouchet, L.-N., & Sadayappan, P. (2013) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2491956.2462187 · Cited by 143
Polyhedral-Model Guided Loop-Nest Auto-Vectorization
Trifunović, K., Nuzman, D., Cohen, A., Zaks, A., & Rosen, I. (2009) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1109/pact.2009.18 · Cited by 122
A Model-Driven Design Framework for Massively Parallel Embedded Systems
Gamatié, A., Beux, S. L., Piel, É., Atitallah, R. B., Etien, A., Marquet, P., & Dekeyser, J. (2011) · ACM Transactions on Embedded Computing Systems · doi:10.1145/2043662.2043663 · Cited by 122
Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time
Pouchet, L.-N., Bastoul, C., Cohen, A., & Vasilache, N. (2007) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo.2007.21 · Cited by 122
Self-citationLoop transformations: convexity, pruning and optimization
Pouchet, L.-N., Bondhugula, U. K. R., Bastoul, C., Cohen, A., Ramanujam, J., Sadayappan, P., & Vasilache, N. (2011) · ACM SIGPLAN Notices · doi:10.1145/1925844.1926449 · Cited by 114
Self-citationPolygeist: 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
SPIRAL: Extreme Performance Portability
Franchetti, F., Low, T. M., Popovici, D. T., Veras, R., Spampinato, D. G., Johnson, J. R., Püschel, M., Hoe, J. C., & Moura, J. M. F. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2873289 · Cited by 133
PLuTo: A practical and fully automatic polyhedral program optimization system
Bondhugula, U. K. R., & Ramanujam, J. (2008) · Cited by 106
Facilitating the search for compositions of program transformations
Cohen, A., Sigler, M., Girbal, S., Temam, O., Parello, D., & Vasilache, N. (2005) · International Conference on Supercomputing · doi:10.1145/1088149.1088169 · Cited by 104
PerfExpert: An Easy-to-Use Performance Diagnosis Tool for HPC Applications
Burtscher, M., Kim, B.-D., Diamond, J., McCalpin, J. D., Koesterke, L., & Browne, J. C. (2010) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc.2010.41 · Cited by 98
Parametric multi-level tiling of imperfectly nested loops
Hartono, A., Baskaran, M. M., Bastoul, C., Cohen, A., Krishnamoorthy, S., Norris, B., Ramanujam, J., & Sadayappan, P. (2009) · International Conference on Supercomputing · doi:10.1145/1542275.1542301 · Cited by 87
Self-citationVerdoolaege, S., & Grosser, T. (2012) · doi:10.13140/rg.2.1.4213.4562 · Cited by 86
HASCO: Towards Agile HArdware and Software CO-design for Tensor Computation
Xiao, Q., Zheng, S., Wu, B., Xu, P., Qian, X., & Liang, Y. E. (2021) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca52012.2021.00086 · Cited by 101
Polyhedral Code Generation in the Real World
Vasilache, N., Bastoul, C., & Cohen, A. (2006) · Lecture notes in computer science · doi:10.1007/11688839_16 · Cited by 83
Self-citationParameterized 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 94
Polyhedral AST Generation Is More Than Scanning Polyhedra
Grosser, T., Verdoolaege, S., & Cohen, A. (2015) · ACM Transactions on Programming Languages and Systems · doi:10.1145/2743016 · Cited by 75
Efficient and scalable computations with sparse tensors
Baskaran, M. M., Meister, B., Vasilache, N., & Lethin, R. (2012) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2012.6408676 · Cited by 79
Combined Iterative and Model-driven Optimization in an Automatic Parallelization Framework
Pouchet, L.-N., Bondhugula, U. K. R., Bastoul, C., Cohen, A., Ramanujam, J., & Sadayappan, P. (2010) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc.2010.14 · Cited by 73
Self-citationMulti-level tiling: M for the price of one
Kim, D., Renganarayanan, L., Rostron, D., Rajopadhye, S. V., & Strout, M. M. (2007) · ACM/IEEE Conference on Supercomputing (SC) · doi:10.1145/1362622.1362691 · Cited by 80
Bondhugula, U. K. R., Acharya, A., & Cohen, A. (2016) · ACM Transactions on Programming Languages and Systems · doi:10.1145/2896389 · Cited by 64
Iterative optimization in the polyhedral model: part ii, multidimensional time
Pouchet, L.-N., Bastoul, C., Cohen, A., & Cavazos, J. (2008) · ACM SIGPLAN Notices · doi:10.1145/1379022.1375594 · Cited by 62
Self-citationAnalytical characterization and design space exploration for optimization of CNNs
Li, R., Xu, Y., Sukumaran-Rajam, A., Rountev, A., & Sadayappan, P. (2021) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3445814.3446759 · Cited by 68
AlphaZ: A System for Design Space Exploration in the Polyhedral Model
Yuki, T., Gupta, G., Kim, D., Pathan, T., & Rajopadhye, S. V. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37658-0_2 · Cited by 61
Loo.py: transformation-based code generation for GPUs and CPUs
Klöckner, A. (2014) · doi:10.1145/2627373.2627387 · Cited by 60
Equivalence checking of static affine programs using widening to handle recurrences
Verdoolaege, S., Janssens, G., & Bruynooghe, M. (2012) · ACM Transactions on Programming Languages and Systems · doi:10.1145/2362389.2362390 · Cited by 60
A framework for enhancing data reuse via associative reordering
Stock, K., Kong, M., Grosser, T., Pouchet, L.-N., Rastello, F., Ramanujam, J., & Sadayappan, P. (2014) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2594291.2594342 · Cited by 70
Chen, C. (2012) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2254064.2254123 · Cited by 57
Baskaran, M. M., Vydyanathan, N., Bondhugula, U. K. R., Ramanujam, J., Rountev, A., & Sadayappan, P. (2009) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/1504176.1504209 · Cited by 57
GRAPHITE Two Years After: First Lessons Learned From Real-World Polyhedral Compilation
Trifunović, K., Cohen, A., Edelsohn, D., Li, F., Grosser, T., Jagasia, H., Ladelsky, R., Pop, S., Sjödin, J., & Upadrasta, R. (2010) · Cited by 56
Quantifier elimination by cylindrical algebraic decomposition based on regular chains
Chen, C., & Maza, M. M. (2015) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2015.11.008 · Cited by 55
A multi-objective auto-tuning framework for parallel codes
Jordan, H., Thoman, P., Durillo, J. J., Pellegrini, S., Gschwandtner, P., Fahringer, T., & Moritsch, H. (2012) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc.2012.7 · Cited by 78
Static and Dynamic Frequency Scaling on Multicore CPUs
Bao, W., Hong, C., Chunduri, S., Krishnamoorthy, S., Pouchet, L.-N., Rastello, F., & Sadayappan, P. (2016) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3011017 · Cited by 54
Predictive Modeling in a Polyhedral Optimization Space
Park, E., Cavazos, J., Pouchet, L.-N., Bastoul, C., Cohen, A., & Sadayappan, P. (2013) · International Journal of Parallel Programming · doi:10.1007/s10766-013-0241-1 · Cited by 66
Self-citationIn search of a program generator to implement generic transformations for high-performance computing
Cohen, A., Donadio, S., Garzarán, M. J., Herrmann, C. A., Kiselyov, O., & Padua, D. (2006) · Science of Computer Programming · doi:10.1016/j.scico.2005.10.013 · Cited by 53
Source-to-Source Optimization for HLS
Cong, J., Huang, M., Pan, P., Wang, Y., & Zhang, P. (2016) · Springer eBooks · doi:10.1007/978-3-319-26408-0_8 · Cited by 53
Predictive modeling in a polyhedral optimization space
Park, E., Pouche, L.-N., Cavazos, J., Cohen, A., & Sadayappan, P. (2011) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo.2011.5764680 · Cited by 57
Compiler Techniques for Massively Scalable Implicit Task Parallelism
Armstrong, T. G., Wozniak, J. M., Wilde, M., & Foster, I. T. (2014) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc.2014.30 · Cited by 51
Vasilache, N., Zinenko, O., Theodoridis, T., Goyal, P., DeVito, Z., Moses, W. S., Verdoolaege, S., Adams, A., & Cohen, A. (2019) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3355606 · Cited by 60
ompVerify: Polyhedral Analysis for the OpenMP Programmer
Basupalli, V., Yuki, T., Rajopadhye, S. V., Morvan, A., Derrien, S., Quinton, P., & Wonnacott, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21487-5_4 · Cited by 51
Practical parallelization of scientific applications with OpenMP, OpenACC and MPI
Aldinucci, M., Cesare, V., Colonnelli, I., Martinelli, A. R., Mittone, G., Cantalupo, B., Cavazzoni, C., & Drocco, M. (2021) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2021.05.017 · Cited by 50
Polyhedral Bubble Insertion: A Method to Improve Nested Loop Pipelining for High-Level Synthesis
Morvan, A., Derrien, S., & Quinton, P. (2013) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2012.2228270 · Cited by 49
Vasilache, N., Bastoul, C., Cohen, A., & Girbal, S. (2006) · International Conference on Supercomputing · doi:10.1145/1183401.1183448 · Cited by 48
Self-citationFeautrier, P., & Lengauer, C. (2011) · Springer eBooks · doi:10.1007/978-0-387-09766-4_502 · Cited by 48
Improving Multibank Memory Access Parallelism with Lattice-Based Partitioning
Cilardo, A., & Gallo, L. (2015) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/2675359 · Cited by 47
Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations
Beletska, A., Bielecki, W., Cohen, A., Pałkowski, M., & Siedlecki, K. (2011) · Parallel Computing · doi:10.1016/j.parco.2010.12.005 · Cited by 47
DynTile: Parametric tiled loop generation for parallel execution on multicore processors
Hartono, A., Baskaran, M. M., Ramanujam, J., & Sadayappan, P. (2010) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2010.5470459 · Cited by 47
The LEAP FPGA Operating System
Fleming, K. E., & Adler, M. (2016) · Springer eBooks · doi:10.1007/978-3-319-26408-0_14 · Cited by 44
Opening polyhedral compiler's black box
Bagnères, L., Zinenko, O., Huot, S., & Bastoul, C. (2016) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/2854038.2854048 · Cited by 44
Self-citationLLOV: A Fast Static Data-Race Checker for OpenMP Programs
Bora, U., Das, S., Kukreja, P., Joshi, S., Upadrasta, R., & Rajopadhye, S. V. (2020) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3418597 · Cited by 44
Clauss, P., Fernandez, F. J., Garbervetsky, D., & Verdoolaege, S. (2009) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2008.2002049 · Cited by 43
Locality-Centric Data and Threadblock Management for Massive GPUs
Khairy, M., Nikiforov, V., Nellans, D. W., & Rogers, T. G. (2020) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro50266.2020.00086 · Cited by 42
Renganarayanan, L., Kim, D., Strout, M. M., & Rajopadhye, S. V. (2012) · ACM Transactions on Programming Languages and Systems · doi:10.1145/2160910.2160912 · Cited by 46
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
Verdoolaege, S., Janssens, G., & Bruynooghe, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02658-4_44 · Cited by 41
The ParaPhrase Project: Parallel Patterns for Adaptive Heterogeneous Multicore Systems
Hammond, K., Aldinucci, M., Brown, C., Cesarini, F., Danelutto, M., González–Vélez, H., Kilpatrick, P., Keller, R., Rossbory, M., & Shainer, G. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-35887-6_12 · Cited by 40
Effective automatic parallelization and locality optimization using the polyhedral model
Sadayappan, P., & Bondhugula, U. K. R. (2008) · Cited by 41
Characterizing and enhancing global memory data coalescing on GPUs
Fauzia, N., Pouchet, L.-N., & Sadayappan, P. (2015) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo.2015.7054183 · Cited by 40
Mehta, S., Beeraka, G., & Yew, P.-C. (2013) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/2541228.2555292 · Cited by 39
A basic linear algebra compiler for structured matrices
Spampinato, D. G., & Püschel, M. (2016) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/2854038.2854060 · Cited by 50
Verdoolaege, S. (2013) · Springer eBooks · doi:10.1007/978-1-4614-6859-2_41 · Cited by 39
Generating piecewise-regular code from irregular structures
Augustine, T., Sarma, J., Pouchet, L.-N., & Rodríguez, G. (2019) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3314221.3314615 · Cited by 35
Optimizing the Memory Hierarchy by Compositing Automatic Transformations on Computations and Data
Zhao, J., & Di, P. (2020) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro50266.2020.00044 · Cited by 38
PERCS: The IBM POWER7-IH high-performance computing system
Rajamony, R., Arimilli, L. B., & Gildea, K. J. (2011) · IBM Journal of Research and Development · doi:10.1147/jrd.2011.2109230 · Cited by 35
Oil and Water Can Mix: An Integration of Polyhedral and AST-Based Transformations
Shirako, J., Pouchet, L.-N., & Sarkar, V. (2014) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc.2014.29 · Cited by 34
Fast Automatic Heuristic Construction Using Active Learning
Ogilvie, W. F., Petoumenos, P., Wang, Z., & Leather, H. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-17473-0_10 · Cited by 34
A Model Driven Design Framework for High Performance Embedded Systems
Gamatié, A., Beux, S. L., Piel, É., Etien, A., Atitallah, R. B., Marquet, P., & Dekeyser, J. (2008) · HAL · Cited by 34
Landscape of High-Performance Python to Develop Data Science and Machine Learning Applications
Castro, O., Bruneau, P., Sottet, J.-S., & Torregrossa, D. (2023) · ACM Computing Surveys · doi:10.1145/3617588 · Cited by 47
Generating efficient data movement code for heterogeneous architectures with distributed-memory
Dathathri, R., Reddy, C., Ramashekar, T., & Bondhugula, U. K. R. (2013) · NOT FOUND REPOSITORY (Indian Institute of Science Bangalore) · doi:10.5555/2523721.2523771 · Cited by 32
Set and Relation Manipulation for the Sparse Polyhedral Framework
Strout, M. M., Georg, G., & Olschanowsky, C. M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37658-0_5 · Cited by 32
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
Analytical cache modeling and tilesize optimization for tensor contractions
Li, R., Sukumaran-Rajam, A., Veras, R., Low, T. M., Rastello, F., Rountev, A., & Sadayappan, P. (2019) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3295500.3356218 · Cited by 31
OpenCGRA: Democratizing Coarse-Grained Reconfigurable Arrays
Tan, C., Agostini, N. B., Zhang, J. J., Minutoli, M., Castellana, V. G., Xie, C., Geng, T., Li, A., BARKER, K. J., & Tumeo, A. (2021) · IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP) · doi:10.1109/asap52443.2021.00029 · Cited by 31
A framework for enhancing data reuse via associative reordering
Stock, K., Kong, M., Grosser, T., Pouchet, L.-N., Rastello, F., Ramanujam, J., & Sadayappan, P. (2014) · ACM SIGPLAN Notices · doi:10.1145/2666356.2594342 · Cited by 34
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
Finding and Applying Loop Transformations for Generating Optimized FPGA Implementations
Devos, H., Beyls, K. E., Christiaens, M., Campenhout, J. V., D'Hollander, E. H., & Stroobandt, D. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-71528-3_11 · Cited by 30
Pałkowski, M., & Bielecki, W. (2017) · BMC Bioinformatics · doi:10.1186/s12859-017-1707-8 · Cited by 30
Improving polyhedral code generation for high-level synthesis
Zuo, W., Li, P., Chen, D., Pouchet, L.-N., Zhong, S., & Cong, J. (2013) · International Conference on Hardware/Software Codesign and System Synthesis · doi:10.1109/codes-isss.2013.6659002 · Cited by 30
Automatic Correction of Loop Transformations
Vasilache, N., Cohen, A., & Pouchet, L.-N. (2007) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1109/pact.2007.4336220 · Cited by 30
Optimizing SDRAM bandwidth for custom FPGA loop accelerators
Bayliss, S., & Constantinides, G. A. (2012) · ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA) · doi:10.1145/2145694.2145727 · Cited by 29
Metadata
- Authors
- Bastoul, C.
- Affiliations
- Université de Versailles Saint-Quentin-en-Yvelines (FR)
- Corresponding author
- Bastoul, C.
- ORCID
- Bastoul, C.
- Venue
- Proceedings. 13th International Conference on Parallel Architecture and Compilation Techniques, 2004. PACT 2004.
- Publisher
- IEEE
- Published
- 2004-11-08
- Pages
- 7-16
- ISSN
- 1089-795X (ISSN-L)
- OpenAlex
- W2076485607
- Cited by
- 447
- References
- 30
- Citations by year
- 2026: 2 · 2025: 4 · 2024: 4 · 2023: 5 · 2022: 6 · 2021: 20 · 2020: 12 · 2019: 19 · 2018: 18 · 2017: 34 · 2016: 39 · 2015: 43 · 2014: 37 · 2013: 33 · 2012: 39
- FWCI
- 5.84
- Type
- conference paper
- Language
- en
- Open access
- green
- hal.science
- Licence
- other-oa
- Locations
- International Conference on Parallel Architectures and Compilation Techniques (PACT) (publishedVersion)
- HAL (submittedVersion, other-oa)
- 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 › Software › Logic, programming, and type systems
- Keywords
- polyhedral models, code generation, program transformation, automatic parallelization, program size, optimizing compilers, feedback-directed 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.