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
Items 101–200 of 457
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
Precise Management of Scratchpad Memories for Localising Array Accesses in Scientific Codes
Größlinger, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00722-4_17 · Cited by 27
High-level Synthesis for Low-power Design
Zhang, Z., Chen, D., Dai, S. X., & Campbell, K. A. (2015) · IPSJ Transactions on System and LSI Design Methodology · doi:10.2197/ipsjtsldm.8.12 · Cited by 27
Gupta, G., & Rajopadhye, S. V. (2007) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/1229428.1229478 · Cited by 27
Locality-centric thread scheduling for bulk-synchronous programming models on CPU architectures
Kim, H.-S., Hajj, I. E., Stratton, J. A., Lumetta, S. S., & Hwu, W. (2015) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo.2015.7054205 · Cited by 26
Array dataflow analysis for polyhedral X10 programs
Yuki, T., Feautrier, P., Rajopadhye, S. V., & Saraswat, V. (2013) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/2442516.2442520 · Cited by 26
Synthesis of divide and conquer parallelism for loops
Farzan, A., & Nicolet, V. (2017) · Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3062341.3062355 · Cited by 25
VMAD: An Advanced Dynamic Program Analysis and Instrumentation Framework
Jimborean, A., Mastrangelo, L., Loechner, V., & Clauss, P. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28652-0_12 · Cited by 25
Interplay of loop unrolling and multidimensional memory partitioning in HLS
Cilardo, A., & Gallo, L. (2015) · Design, Automation, and Test in Europe · doi:10.5555/2755753.2755789 · Cited by 25
PLUTO+: near-complete modeling of affine transformations for parallelism and locality
Acharya, A., & Bondhugula, U. K. R. (2015) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/2688500.2688512 · Cited by 24
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
Mikushin, D., Likhogrud, N., Zhang, E. Z., & Bergström, C. (2014) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw.2014.115 · Cited by 23
Schordan, M., Lin, P., Quinlan, D., & Pouchet, L.-N. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-45231-8_41 · Cited by 23
New advances of high-level synthesis for efficient and reliable hardware design
Campbell, K. A., Zuo, W., & Chen, D. (2016) · Integration · doi:10.1016/j.vlsi.2016.11.006 · Cited by 25
PPLite: Zero-overhead encoding of NNC polyhedra
Becchi, A., & Enea Zaffanella, A. (2020) · Information and Computation · doi:10.1016/j.ic.2020.104620 · Cited by 23
Putting Automatic Polyhedral Compilation for GPGPU to Work
Baghdadi, S., Größlinger, A., & Cohen, A. (2011) · Cited by 22
Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations
Verdoolaege, S., Cohen, A., & Beletska, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23702-7_18 · Cited by 22
Reddy, C., & Bondhugula, U. K. R. (2014) · International Conference on Supercomputing · doi:10.1145/2597652.2597673 · Cited by 22
Quantifier elimination by cylindrical algebraic decomposition based on regular chains
Chen, C., & Maza, M. M. (2014) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2608628.2608666 · Cited by 22
When polyhedral transformations meet SIMD code generation
Kong, M., Veras, R., Stock, K., Franchetti, F., Pouchet, L.-N., & Sadayappan, P. (2013) · ACM SIGPLAN Notices · doi:10.1145/2499370.2462187 · Cited by 26
Polyhedral parallelization of binary code
Pradelle, B., Ketterlin, A., & Clauss, P. (2012) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/2086696.2086718 · Cited by 21
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
Network footprint reduction through data access and computation placement in NoC-based manycores
Liu, J., Kotra, J., Ding, W., & Kandemir, M. (2015) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/2744769.2744876 · 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
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
MPSoC memory optimization using program transformation
Bouchebaba, Y., Girodias, B., Nicolescu, G., Aboulhamid, E. M., Lavigueur, B., & Paulin, P. G. (2007) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/1278349.1278356 · Cited by 20
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
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
Efficient nested loop pipelining in high level synthesis using polyhedral bubble insertion
Morvan, A., Derrien, S., & Quinton, P. (2011) · International Conference on Field-Programmable Technology (FPT) · doi:10.1109/fpt.2011.6132715 · Cited by 19
PolyCheck: dynamic verification of iteration space transformations on affine programs
Bao, W., Krishnamoorthy, S., Pouchet, L.-N., Rastello, F., & Sadayappan, P. (2016) · ACM SIGPLAN Notices · doi:10.1145/2837614.2837656 · Cited by 19
On-chip cache hierarchy-aware tile scheduling for multicore machines
Liu, J., Zhang, Y., Ding, W., & Kandemir, M. (2011) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo.2011.5764684 · Cited by 19
Towards effective automatic parallelization for multicore systems
Bondhugula, U. K. R., Baskaran, M. M., Hartono, A., Krishnamoorthy, S., Ramanujam, J., Rountev, A., & Sadayappan, P. (2008) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2008.4536401 · Cited by 17
Polyhedral Optimizations for a Data-Flow Graph Language
Sbîrlea, A., Shirako, J., Pouchet, L.-N., & Sarkar, V. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29778-1_4 · Cited by 17
Joint scheduling and layout optimization to enable multi-level vectorization
Vasilache, N., Meister, B., Baskaran, M., & Lethin, R. (n.d.) · Cited by 17
Modular divide-and-conquer parallelization of nested loops
Farzan, A., & Nicolet, V. (2019) · Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3314221.3314612 · Cited by 16
Efficient Tiled Loop Generation: D-Tiling
Kim, D., & Rajopadhye, S. V. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13374-9_20 · Cited by 16
Balasa, F., Kjeldsberg, P. G., Vandecappelle, A., Palkovic, M., Hu, Q., Zhu, H., & Catthoor, F. (2008) · Journal of Signal Processing Systems · doi:10.1007/s11265-008-0244-0 · Cited by 16
Trade-offs in loop transformations
Palkovič, M., Catthoor, F., & Corporaal, H. (2009) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/1497561.1497565 · Cited by 16
A polyhedral compilation framework for loops with dynamic data-dependent bounds
Zhao, J., Kruse, M., & Cohen, A. (2018) · doi:10.1145/3178372.3179509 · Cited by 16
CMOST: a system-level FPGA compilation framework
Zhang, P., Huang, M., Xiao, B., Huang, H., & Cong, J. (2015) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/2744769.2744807 · Cited by 15
Stawinoga, N., & Field, T. (2018) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3194242 · Cited by 17
A Direct Encoding for NNC Polyhedra
Becchi, A., & Enea Zaffanella, A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96145-3_13 · Cited by 15
Quantifier elimination in automatic loop parallelization
Größlinger, A., Griebl, M., & Lengauer, C. (2006) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2005.09.012 · Cited by 15
Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops
Beletska, A., Bielecki, W., Siedlecki, K., & Pietro, P. S. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69848-7_69 · Cited by 15
Optimizing I/O for big array analytics
Zhang, Y., & Yang, J. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2212351.2212358 · Cited by 14
A Graphical Framework for High Performance Computing Using An MDE Approach
Taillard, J., Guyomarc'h, F., & Dekeyser, J. (2008) · Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) · doi:10.1109/pdp.2008.74 · Cited by 14
PIPES: A Language and Compiler for Task-Based Programming on Distributed-Memory Clusters
Kong, M., Pouchet, L.-N., Sadayappan, P., & Sarkar, V. (2016) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc.2016.38 · Cited by 14
Compiling Affine Loop Nests for a Dynamic Scheduling Runtime on Shared and Distributed Memory
Dathathri, R., Mullapudi, R. T., & Bondhugula, U. K. R. (2016) · ACM Transactions on Parallel Computing · doi:10.1145/2948975 · Cited by 14
TRACO: An Automatic Loop Nest Parallelizer for Numerical Applications
Pałkowski, M., Klimek, T., & Bielecki, W. (2015) · Annals of Computer Science and Information Systems · doi:10.15439/2015f34 · Cited by 13
Loo.py: from fortran to performance via transformation and substitution rules
Klöckner, A. (2015) · ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming (ARRAY) · doi:10.1145/2774959.2774969 · Cited by 13
TurboTiling: Leveraging Prefetching to Boost Performance of Tiled Codes
Mehta, S., Garg, R., Trivedi, N., & Yew, P.-C. (2016) · International Conference on Supercomputing · doi:10.1145/2925426.2926288 · Cited by 13
Bielecki, W., & Pałkowski, M. (2015) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-15147-2_26 · Cited by 13
Exact join detection for convex polyhedra and other numerical abstractions
Roberto Bagnara, A., Hill, P. M., & Enea Zaffanella, A. (2009) · Computational Geometry · doi:10.1016/j.comgeo.2009.09.002 · Cited by 13
Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework
Beletska, A., Bielecki, W., & Pietro, P. S. (2007) · International Symposium on Parallel and Distributed Computing · doi:10.1109/ispdc.2007.21 · Cited by 13
Optimized two-level parallelization for GPU accelerators using the polyhedral model
Shirako, J., Hayashi, A., & Sarkar, V. (2017) · doi:10.1145/3033019.3033022 · Cited by 12
Hagemann, W. (2015) · Mathematics in Computer Science · doi:10.1007/s11786-015-0238-9 · Cited by 12
Loop Transformation Methodologies for Array-Oriented Memory Management
Balasa, F., Kjeldsberg, P. G., Palkovic, M., Vandecappelle, A., & Catthoor, F. (2006) · IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP) · doi:10.1109/asap.2006.42 · Cited by 12
Improved derivation of process networks
Verdoolaege, S., Nikolov, H. N., & Stefanov, T. P. (2006) · Lirias · Cited by 12
XFOR: Filling the Gap between Automatic Loop Optimization and Peak Performance
Fassi, I., & Clauss, P. (2015) · International Symposium on Parallel and Distributed Computing · doi:10.1109/ispdc.2015.19 · Cited by 11
Specializing Compiler Optimizations through Programmable Composition for Dense Matrix Computations
Yi, Q., Wang, Q., & Cui, H. (2014) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro.2014.14 · Cited by 11
TRACO: Source-to-Source Parallelizing Compiler
Pałkowski, M., & Bielecki, W. (2016) · Cited by 11
Compiling and Optimizing OpenMP 4.X Programs to OpenCL and SPIR
Pereira, M. M., Sousa, R. C. F., & Araujo, G. C. S. D. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-65578-9_4 · Cited by 11
Piętak, K., Żurek, D., Pietroń, M., Dymara, A., & Kisiel‐Dorohinicki, M. (2019) · Journal of Computational Science · doi:10.1016/j.jocs.2019.01.007 · Cited by 13
Synthesis of divide and conquer parallelism for loops
Farzan, A., & Nicolet, V. (2017) · ACM SIGPLAN Notices · doi:10.1145/3140587.3062355 · Cited by 11
Adaptive runtime selection of parallel schedules in the polytope model
Pradelle, B., Clauss, P., & Loechner, V. (2011) · HAL · doi:10.5555/2048577.2048588 · Cited by 11
Dynamic memory access monitoring based on tagged memory
Dathathri, R., Reddy, C., Ramashekar, T., & Bondhugula, U. K. R. (2013) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1109/pact.2013.6618833 · Cited by 11
Array Data Dependence Testing with the Chains of Recurrences Algebra
van Engelen, R. A., Birch, J., & Gallivan, K. A. (2005) · International Workshop on Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA) · doi:10.1109/iwia.2004.10018 · Cited by 11
PolyJIT: Polyhedral Optimization Just in Time
Simbürger, A., Apel, S., Größlinger, A., & Lengauer, C. (2018) · International Journal of Parallel Programming · doi:10.1007/s10766-018-0597-3 · Cited by 10
Optimizing GPU Deep Learning Operators with Polyhedral Scheduling Constraint Injection
Bastoul, C., Zhang, Z., Razanajato, H., Lossing, N., Susungi, A., de Juan, J., Filhol, E., Jarry, B., Consolaro, G., & Zhang, R. (2022) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo53902.2022.9741260 · Cited by 11
Self-citationDFGR an Intermediate Graph Representation for Macro-Dataflow Programs
Sbîrlea, A., Pouchet, L.-N., & Sarkar, V. (2014) · Workshop on Data-Flow Execution Models for Extreme Scale Computing (DFM) · doi:10.1109/dfm.2014.9 · Cited by 12
The potential of polyhedral optimization: An empirical study
Simbürger, A., Apel, S., Größlinger, A., & Lengauer, C. (2013) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.2013.6693108 · Cited by 10
Parametric GPU Code Generation for Affine Loop Programs
Konstantinidis, A., Kelly, P. H. J., Ramanujam, J., & Sadayappan, P. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-09967-5_8 · Cited by 10
Tile size selection of affine programs for GPGPUs using polyhedral cross-compilation
Abdelaal, K., & Kong, M. (2021) · International Conference on Supercomputing · doi:10.1145/3447818.3460369 · Cited by 10
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
Self-citationPhism: Polyhedral High-Level Synthesis in MLIRPreprint
Zhao, R., & Cheng, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.15103 · Cited by 10
A Tale of Three RuntimesPreprint
Vasilache, N., Baskaran, M. M., Henretty, T., Meister, B., Langston, H., Tavarageri, S., & Lethin, R. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.1914 · Cited by 10
How daily code mixing becomes a new strategy for teaching vocabulary mastery
Sabri, M. M. Z., Pratolo, B. W., & Basopi, P. (2019) · Journal of Education and Learning (EduLearn) · doi:10.11591/edulearn.v13i4.13372 · Cited by 14
Scan detection and parallelization in "inherently sequential" nested loop programs
Zou, Y., & Rajopadhye, S. V. (2012) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/2259016.2259027 · Cited by 9
VMAD: A virtual machine for advanced dynamic analysis of programs
Jimborean, A., Herrmann, M., Loechner, V., & Clauss, P. (2011) · IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS) · doi:10.1109/ispass.2011.5762725 · Cited by 9
Monoparametric Tiling of Polyhedral Programs
Iooss, G., Alias, C., & Rajopadhye, S. V. (2021) · International Journal of Parallel Programming · doi:10.1007/s10766-021-00694-2 · 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
A Systematic Approach toward Automated Performance Analysis and Tuning
Cong, G., Chung, I., Wen, H.-F., Klepacki, D. J., Murata, H., Negishi, Y., & Moriyama, T. (2011) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2011.189 · Cited by 9
Cardoso, J. M. P., & Weinhardt, M. (2016) · Springer eBooks · doi:10.1007/978-3-319-26408-0_2 · Cited by 9
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
Modeling adaptive streaming applications with parameterized polyhedral process networks
Zhai, J. T., Nikolov, H., & Stefanov, T. P. (2011) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/2024724.2024752 · Cited by 9
Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations
Bielecki, W., Beletska, A., Pałkowski, M., & Pietro, P. S. (2008) · Springer eBooks · doi:10.1007/978-3-540-69501-1_20 · Cited by 9
Adapting the polytope model for dynamic and speculative parallelization
Jimborean, A. (2012) · theses.fr (ABES) · doi:10.70675/cb7e67daz6620z4ce8z8150za75dfaed0005 · Cited by 9
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
Exploiting distributed and shared memory hierarchies with Hitmap
Moreton‐Fernandez, A., González-Escribano, A., & Llanos, D. R. (2014) · International Conference on High Performance Computing & Simulation (HPCS) · doi:10.1109/hpcsim.2014.6903696 · Cited by 8
PIPS Is not (just) Polyhedral Software Adding GPU Code Generation in PIPS
Amini, M., Ancourt, C., Coelho, F., Creusillet, B., Guelton, S., Irigoin, F., Jouvelot, P., Keryell, R., & Villalon, P. (2011) · Cited by 8
Verdoolaege, S. (2015) · Lirias · doi:10.13140/2.1.1313.6968 · Cited by 8
Pałkowski, M., & Bielecki, W. (2015) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-15147-2_34 · Cited by 8
Parallel 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
Chen, C. (2012) · ACM SIGPLAN Notices · doi:10.1145/2345156.2254123 · Cited by 8
Refactoring GrPPI: Generic Refactoring for Generic Parallelism in C++
Brown, C., Janjic, V., Barwell, A. D., García, J. D., & MacKenzie, K. (2020) · International Journal of Parallel Programming · doi:10.1007/s10766-020-00667-x · Cited by 8
Tuna: A Static Analysis Approach to Optimizing Deep Neural NetworksPreprint
Wang, Y., Zhou, X., Wang, Y., Li, R., Wu, Y., & Sharma, V. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.14641 · Cited by 9
Switchable Scheduling for Runtime Adaptation of Optimization
Bagnères, L., & Bastoul, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-09873-9_19 · Cited by 7
Self-citationSynthesising graphics card programs from DSLs
Cartey, L., Lyngsø, R. B., & de Moor, O. (2012) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2254064.2254080 · Cited by 7
The Challenges of Non-linear Parameters and Variables in Automatic Loop Parallelisation
Größlinger, A. (2010) · Cited by 7
Manipulating Visualization, Not Codes
Zinenko, O., Bastoul, C., & Huot, S. (2015) · LillOA (Université de Lille (University Of Lille)) · Cited by 7
Self-citation
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.