Putting polyhedral loop transformations to work

DOI10.1007/978-3-540-24644-2_14MaRDI QIDQ5714193zbMATH OpenOpenAlexFDO

Authors Cédric Bastoul, Albert Cohen, Sylvain Girbal, Saurabh Kumar Sharma, Olivier Temam

Publication date 27 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b95707

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of compilers and interpreters (68N20)

Recommendations

• A polyhedral approach to ease the composition of program transformations
• PIT: a framework for effectively composing high-level loop transformations
• scientific article; zbMATH DE number 1218791
• Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies
• Loop transformations, convexity, pruning and optimization

Cited in

(10)

• A methodology pruning the search space of six compiler transformations by addressing them together as one problem and by exploiting the hardware architecture details
• PIT: a framework for effectively composing high-level loop transformations
• scientific article; zbMATH DE number 1218791 (Why is no real title available?)
• Mathematical tools for loop transformations: From systems of uniform recurrence equations to the polytope model
• Cache models for iterative compilation
• A polyhedral approach to ease the composition of program transformations
• Loop transformations, convexity, pruning and optimization
• Cetus -- an extensible compiler infrastructure for source-to-source transformation
• isl: An integer set library for the polyhedral model
• Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies

This page was built for publication: Putting polyhedral loop transformations to work

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714193)