Loop-Carried Code Placement

Abstract. 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 preliminary results for a simple example.

• Type: Conference
• Year: 2001
• Where: EUROPAR
• Authors: Peter Faber, Martin Griebl, Christian Lengauer
• Keywords: Code Optimization Techniques, Code Placement Techniques, Distributed And Parallel Computing, EUROPAR 2001, Expressions Containing Array