Traditional code optimization techniques treat loops as nonpredictable structures and do not consider expressions containing array accesses for optimization. We show that the polyhedron model can be used to implement code placement techniques that exploit equalities of expressions that hold between loop iterations. We also present preliminaryresu lts for a simple example.
CITATION STYLE
Faber, P., Griebl, M., & Lengauer, C. (2001). Loop-carried code placement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2150, pp. 230–235). Springer Verlag. https://doi.org/10.1007/3-540-44681-8_34
Mendeley helps you to discover research relevant for your work.