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 201–300 of 457
PolyGLoT: A Polyhedral Loop Transformation Framework for a Graphical Dataflow Language
Bhaskaracharya, S. G., & Bondhugula, U. K. R. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37051-9_7 · Cited by 7
Mapping deviation: a technique to adapt or to guard loop transformation intuitions for legality
Bastoul, C. (2016) · doi:10.1145/2892208.2892216 · Cited by 7
Self-citationAn integer set library for program analysis
Verdoolaege, S. (2009) · Lirias · Cited by 7
The CR# Algebra and its Application in Loop Analysis and Optimization
van Engelen, R. A. (2004) · doi:10.13140/rg.2.2.31266.03528 · Cited by 7
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
Self-citationMagomedov, S. G., & Lebedev, A. S. (2019) · Russian Technological Journal · doi:10.32362/2500-316x-2019-7-5-7-19 · Cited by 7
PLUTO+: near-complete modeling of affine transformations for parallelism and locality
Acharya, A., & Bondhugula, U. K. R. (2015) · ACM SIGPLAN Notices · doi:10.1145/2858788.2688512 · Cited by 7
A Holistic Approach towards Automated Performance Analysis and Tuning
Cong, G., Chung, I., Wen, H.-F., Klepacki, D. J., Murata, H., Negishi, Y., & Moriyama, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03869-3_7 · Cited by 7
Explicit Dependence Metadata in an Active Visual Effects Library
Cornwall, J. L. T., Kelly, P. H. J., Parsonage, P., & Nicoletti, B. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85261-2_12 · Cited by 7
Hybrid Iterative and Model-Driven Optimization in the Polyhedral Model
Pouchet, L.-N., Bondhugula, U. K. R., Bastoul, C., Cohen, A., Ramanujam, R., & Sadayappan, P. (2009) · Cited by 7
Self-citationEnhanced applicability of loop transformations
Palkovic, M. (2007) · TU/e Research Portal · doi:10.6100/ir629342 · Cited by 7
Memory reuse optimizations in the R-Stream compiler
Vasilache, N., Baskaran, M. M., Meister, B., & Lethin, R. (2013) · doi:10.1145/2458523.2458528 · Cited by 6
Huang, D., Wen, M., Xun, C., Chen, D., Cai, X. H., Qiao, Y., Wu, N., & Zhang, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-09873-9_18 · Cited by 6
Modeling the Interplay between Loop Tiling and Fusion in Optimizing Compilers Using Affine Relations
Zhao, J., Xu, J., Di, P., Nie, W., Hu, J., Yi, Y., Yang, S., Geng, Z., Zhang, R., Li, B., et al. (2023) · ACM Transactions on Computer Systems · doi:10.1145/3635305 · Cited by 6
Derivation of efficient FSM from loop nests
Yuki, T., Morvan, A., & Derrien, S. (2013) · International Conference on Field-Programmable Technology (FPT) · doi:10.1109/fpt.2013.6718367 · Cited by 6
Code Bones: Fast and Flexible Code Generation for Dynamic and Speculative Polyhedral Optimization
Caamaño, J. M. M., Wolff, W., & Clauss, P. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-43659-3_17 · Cited by 6
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
Loop Fusion with Outer Loop Shifting for High-level Synthesis
Kato, Y., & Seto, K. (2013) · IPSJ Transactions on System and LSI Design Methodology · doi:10.2197/ipsjtsldm.6.71 · Cited by 6
Towards a Domain-Extensible Compiler: Optimizing an Image Processing Pipeline on Mobile CPUs
Kœhler, T., & Steuwer, M. (2021) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo51591.2021.9370337 · Cited by 10
Mechanisms that separate algorithms from implementations for parallel patterns
Krieger, C. D., Stone, A., & Strout, M. M. (2010) · doi:10.1145/1953611.1953622 · Cited by 6
Scheduling in the Z-Polyhedral Model
Gautam, Kim, D., & Rajopadhye, S. V. (2007) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2007.370229 · Cited by 6
Software-controlled processor stalls for time and energy efficient data locality optimization
Clauss, P., Fassi, I., & Jimborean, A. (2014) · International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation · doi:10.1109/samos.2014.6893212 · Cited by 5
From a Formalized Parallel Action Language to Its Efficient Code Generation
Llopard, I., Fabre, C., & Cohen, A. (2017) · ACM Transactions on Embedded Computing Systems · doi:10.1145/2990195 · Cited by 5
Revisiting split tiling for stencil computations in polyhedral compilation
Li, Y., Sun, H., & Pang, J. (2021) · The Journal of Supercomputing · doi:10.1007/s11227-021-03835-z · Cited by 6
PolyTOPS: Reconfigurable and Flexible Polyhedral Scheduler
Consolaro, G., Zhang, Z., Razanajato, H., Lossing, N., Tchoulak, N., Susungi, A., Alves, A. C. A., Zhang, R., Barthou, D., Ancourt, C., et al. (2024) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo57630.2024.10444791 · Cited by 6
Self-citationOn the Computer Generation of Adaptive Numerical Libraries
Püschel, M., & de Mesmay, F. (2011) · Cited by 5
Array Program Transformation with Loo.py by Example: High-Order Finite Elements
Klöckner, A., Wilcox, L. C., & Warburton, T. (2016) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 5
Minimal Unroll Factor for Code Generation of Software Pipelining
Bachir, M., Touati, S. A. A., Brault, F., Gregg, D., & Cohen, A. (2012) · International Journal of Parallel Programming · doi:10.1007/s10766-012-0203-z · Cited by 5
Array program transformation with Loo.py by example: high-order finite elements
Klöckner, A., Wilcox, L. C., & Warburton, T. (2016) · ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming (ARRAY) · doi:10.1145/2935323.2935325 · Cited by 5
Synchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing
Beletska, A., Bielecki, W., Cohen, A., & Pałkowski, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13374-9_16 · Cited by 5
A Note on the Performance Distribution of Affine Schedules
Pouchet, L.-N., Bastoul, C., Cavazos, J., & Cohen, A. (2008) · Cited by 5
Self-citationThe Potential of Polyhedral Optimization
Simbürger, A., Apel, S., Größlinger, A., & Lengauer, C. (2013) · Cited by 4
Just-in-time shape inference for array-based languages
Garg, R. D., & Hendren, L. J. (2014) · doi:10.1145/2627373.2627382 · Cited by 4
Two-phase execution of binary applications on CPU/GPU machines
Zhu, E., Ma, R., Hou, Y., Yang, Y., Liu, F., & Guan, H. (2014) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2014.02.002 · Cited by 4
Automatic Energy Efficient Parallelization of Uniform Dependence Computations
Zou, Y., & Rajopadhye, S. V. (2015) · International Conference on Supercomputing · doi:10.1145/2751205.2751245 · Cited by 4
Heterogeneous programming with Single Operation Multiple Data
Paulino, H., & Marques, E. R. B. (2014) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2014.06.021 · 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
On the run-time cost of distributed-memory communications generated using the polyhedral model
Moreton‐Fernandez, A., González-Escribano, A., & Llanos, D. R. (2015) · International Conference on High Performance Computing & Simulation (HPCS) · doi:10.1109/hpcsim.2015.7237034 · Cited by 4
C-to-CoRAM: compiling perfect loop nests to the portable CoRAM abstraction
Weisz, G., & Hoe, J. C. (2013) · ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA) · doi:10.1145/2435264.2435302 · Cited by 4
Communication Avoiding Algorithms: Analysis and Code Generation for Parallel Systems
Murthy, K. S., & Mellor‐Crummey, J. (2015) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1109/pact.2015.41 · Cited by 4
A Code Generator for Energy-Efficient Wavefront Parallelization of Uniform Dependence Computations
Zou, Y., & Rajopadhye, S. V. (2017) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2017.2709748 · Cited by 6
Adaptive Code Refinement: A Compiler Technique and Extensions to Generate Self-Tuning Applications
Schmitt, M., Helluy, P., & Bastoul, C. (2017) · IEEE International Conference on High Performance Computing, Data, and Analytics · doi:10.1109/hipc.2017.00028 · Cited by 4
Self-citationData-flow analysis and optimization for data coherence in heterogeneous architectures
de Sousa, R. T., Pereira, M., Pereira, F. M. Q., & Araujo, G. C. S. D. (2019) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2019.04.004 · Cited by 4
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
Intermediate Representations for Explicitly Parallel Programs
Susungi, A., & Tadonki, C. (2021) · ACM Computing Surveys · doi:10.1145/3452299 · Cited by 5
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
Improving the Performance of X10 Programs by Clock Removal
Feautrier, P., Violard, É., & Ketterlin, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54807-9_7 · Cited by 4
GPU code generation for ODE-based applications with phased shared-data access patterns
Hagiescu, A., Liu, B., Ramanathan, R., Palaniappan, S. K., Cui, Z., Chattopadhyay, B., Thiagarajan, P. S., & Wong, W. (2013) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/2541228.2555311 · Cited by 4
Evaluation of state-of-the-art polyhedral tools for automatic code generation on GPUs
Juega, J. C., Gómez, J. I., Tenllado, C., Verdoolaege, S., Cohen, A., & Catthoor, F. (2012) · Cited by 4
Grosser, T. (2014) · theses.fr (ABES) · doi:10.70675/b2acb1f0zf5a6z4a0cz94a9zfc2cee8b4571 · Cited by 7
Speeding up Iterative Polyhedral Schedule Optimization with Surrogate Performance Models
Ganser, S., Größlinger, A., Siegmund, N., Apel, S., & Lengauer, C. (2018) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3291773 · Cited by 3
QRANE: lifting QASM programs to an affine IR
Gerard, B., Grosser, T., & Kong, M. (2022) · ACM SIGPLAN International Conference on Compiler Construction (CC) · doi:10.1145/3497776.3517775 · Cited by 4
Optimization 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
A New High-Level Parallel Portable Language for Hierarchical Systems in Trasgo
Moreton‐Fernandez, A., Escribano, A. G., & Llanos, D. R. (2015) · 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
Design and Implementation of Multi-Threaded Algorithms in Polynomial Algebra
Maza, M. M. (2021) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3452143.3465511 · Cited by 3
Compiling pattern matching to in-place modifications
Iannetta, P., Gonnord, L., & Radanne, G. (2021) · ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences (GPCE) · doi:10.1145/3486609.3487204 · Cited by 3
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
Kelefouras, V. I., Kritikakou, A. S., & Goutis, C. E. (2015) · Computer Languages · doi:10.1016/j.cl.2015.01.003 · Cited by 3
GPGPU Memory Estimation and Optimization Targeting OpenCL Architecture
Zhu, J., Chen, G., & Wu, B. (2012) · IEEE International Conference on Cluster Computing (CLUSTER) · doi:10.1109/cluster.2012.9 · Cited by 3
Wen, M., Huang, D., Xun, C., & Chen, D. (2015) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.1500032 · Cited by 3
Towards a framework for automated performance tuning
Cong, G., Seelam, S., Chung, I., Wen, H., & Klepacki, D. J. (2009) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2009.5161157 · Cited by 3
Coarse-Grained Loop Parallelization: Iteration Space Slicing vs Affine Transformations
Beletska, A., Bielecki, W., Cohen, A., Pałkowski, M., & Siedlecki, K. (2009) · International Symposium on Parallel and Distributed Computing · doi:10.1109/ispdc.2009.15 · Cited by 3
Efficient Hardware Looping Units for FPGAs
Kavvadias, N., & Μασσέλος, Κ. (2010) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi.2010.63 · Cited by 3
On Computing Solutions of Linear Diophantine Equations with One Non-linear Parameter
Größlinger, A., & Schuster, S. (2008) · International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) · doi:10.1109/synasc.2008.33 · Cited by 3
Automating data management in heterogeneous systems using polyhedral analysis
Vassiliadis, V., Antonopoulos, C. D., & Zindros, G. (2015) · Panhellenic Conference on Informatics · doi:10.1145/2801948.2801957 · Cited by 3
Customizable Heterogeneous Acceleration for Tomorrow's High-Performance Computing
Cilardo, A., Flich, J., Gagliardi, M., & Tornero, R. (2015) · 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-css-icess.2015.303 · Cited by 3
Seyfari, Y., Lotfi, S., & Karimpour, J. (2017) · Scalable Computing Practice and Experience · doi:10.12694/scpe.v18i1.1234 · Cited by 3
A High Level Synthesis Flow Using Model Driven Engineering
Beux, S. L., Moss, L., Marquet, P., & Dekeyser, J. (2010) · Lecture notes in electrical engineering · doi:10.1007/978-90-481-9965-5_12 · Cited by 3
Pradelle, B. (2011) · Cited by 3
Compile-time support for thread-level speculation
Aldea, S. (2014) · UVaDOC UVaDOC University of Valladolid Documentary Repository (University of Valladolid) · doi:10.35376/10324/6495 · Cited by 3
Model Driven Engineering Benefits for High Level Synthesis
Beux, S. L., Marquet, P., & Dekeyser, J. (2008) · LillOA (Université de Lille (University Of Lille)) · Cited by 3
Transformations for polyhedral process networks
Meijer, S. (2010) · Leiden Repository (Leiden University) · Cited by 3
Periodic register saturation in innermost loops
Touati, S. A. A., & Mathe, Z. (2008) · Parallel Computing · doi:10.1016/j.parco.2008.12.001 · Cited by 3
Chen, C., Chen, X., Keita, A.-K., Maza, M. M., & Xie, N. (n.d.) · Cited by 3
Automated Synthesis of Divide and Conquer ParallelismPreprint
Farzan, A., & Nicolet, V. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.08345 · Cited by 3
Réseaux de processus flots de données avec routage pour la modélisation de systèmes embarqués
Coadou, A. (2010) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 3
Atitallah, R. B. (2008) · theses.fr (ABES) · doi:10.70675/ddd60604z9b9bz4196z9695z895e06eb71ee · Cited by 3
Code optimization based on source to source transformations using profile guided metrics
Lebras, Y. (2019) · theses.fr (ABES) · doi:10.70675/51930b8cz6c07z419az81adzcba38210a8c5 · Cited by 5
Irigoin, F., Amini, M., Ancourt, C., Coelho, F., Creusillet, B., & Keryell, R. (2011) · HAL · doi:10.3166/tsi.31.987-1019 · Cited by 2
Intelligent Heuristic Construction with Active Learning
Ogilvie, W. F., Wang, Z., Petoumenos, P., & Leather, H. (2015) · Lancaster EPrints (Lancaster University) · Cited by 2
A technique to automatically determine Ad-hoc communication patterns at runtime
Moreton‐Fernandez, A., González-Escribano, A., & Llanos, D. R. (2017) · Parallel Computing · doi:10.1016/j.parco.2017.08.009 · Cited by 2
Big Data and HPC Acceleration with Vivado HLS
Schmid, M., Schmitt, C., Hannig, F., Malazgirt, G. A., Sönmez, N., Yurdakul, A., & Cristal, A. (2016) · Springer eBooks · doi:10.1007/978-3-319-26408-0_7 · Cited by 2
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
Self-citationA Pipeline Pattern Detection Technique in Polly
Talaashrafi, D., Doerfert, J., & Maza, M. M. (2022) · International Conference on Parallel Processing Workshops (ICPPW) · doi:10.1145/3547276.3548445 · Cited by 2
Efficient detection of redundancies in systems of linear inequalities✱
Jing, R.-J., Maza, M. M., Xie, Y. Q., & Yuan, C.-M. (2024) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3666000.3669708 · Cited by 2
Efficient detection of redundancies in systems of linear inequalities
Jing, R.-J., Maza, M. M., Mukherjee, C., Xie, Y. Q., & Yuan, C.-M. (2025) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2025.102527 · 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
An Optimization Compiler Framework Based on Polyhedron Model for GPGPUs
Liu, L. (2017) · OhioLink ETD Center (Ohio Library and Information Network) · Cited by 2
FPGA Resource Estimation for Loop Controllers
Degryse, T., Devos, H., & Stroobandt, D. (2008) · Ghent University Academic Bibliography (Ghent University) · Cited by 2
Safety considerations for WCET evaluation methods in avionic equipment
Jean, X., Girbal, S., Roger, A., Megel, T., & Brindejonc, V. (2015) · IEEE/AIAA Digital Avionics Systems Conference (DASC) · doi:10.1109/dasc.2015.7311462 · Cited by 2
Augmentation of Programs with CUDA Streams
Sharmistha, Amilkanthwar, M., & Balachandran, S. (2012) · IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA) · doi:10.1109/ispa.2012.132 · Cited by 2
Generating On-Chip Heterogeneous Systems from High-Level Parallel Code
Cilardo, A., & Gallo, L. (2014) · Euromicro Conference on Digital System Design (DSD) · doi:10.1109/dsd.2014.58 · Cited by 2
Automatic synthesis of processor arrays with local memories on FPGAs
Wu, G., Dou, Y., & Wang, M. (2010) · International Conference on Field-Programmable Technology (FPT) · doi:10.1109/fpt.2010.5681493 · Cited by 2
Sequential C-code to distributed pipelined heterogeneous MPSoC synthesis for streaming applications
Ambrose, J. A., Yachide, Y., Batra, K., Peddersen, J., & Parameswaran, S. (2015) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd.2015.7357106 · Cited by 2
Trifunović, K., Cohen, A., Ladelsky, R., & Li, F. (2011) · HAL · Cited by 2
Polyhedral Source-to-Source Compiler
Adamski, D., Jabłoński, G., Perek, P., & Napieralski, A. (2016) · International Conference Mixed Design of Integrated Circuits and Systems · doi:10.1109/mixdes.2016.7529786 · Cited by 2
Towards Automatic C Programs Optimization and Parallelization using the PIPS-PoCC Integration
Khaldi, D., Ancourt, C., & Irigoin, F. (2011) · 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
Lebedev, A. S. (2017) · Program systems theory and applications · doi:10.25209/2079-3316-2017-8-4-3-20 · Cited by 2
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.