A polyhedral approach to ease the composition of program transformations

DOI10.1007/978-3-540-27866-5_38MaRDI QIDQ5311397zbMATH OpenOpenAlexFDO

Authors Albert Cohen, Sylvain Girbal, Olivier Temam

Publication date 23 August 2005

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

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

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

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

Cited in

(7)

• PIT: a framework for effectively composing high-level loop transformations
• A Framework for Point-Free Program Transformation
• Transformation of algorithms written in the form of composition schemes
• From sequential programs to multi-tier applications by program transformation
• Putting polyhedral loop transformations to work
• Program transformation system based on generalized partial computation
• Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies

Describes a project that uses

Uses Software

• OCEANS
• FADAlib

This page was built for publication: A polyhedral approach to ease the composition of program transformations

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