Replicated Placements in the Polyhedron Model

Abstract. Loop-carried code placement (LCCP) is able to remove redundant computations that cannot be recognized by traditional code motion techniques. However, this comes possibly at the price of increased communication time. We aim at minimizing the communication time by using replicated storage.

• Type: Conference
• Year: 2003
• Where: EUROPAR
• Authors: Peter Faber, Martin Griebl, Christian Lengauer
• Keywords: Communication Time, EUROPAR 2003, Loop-carried Code Placement, Traditional Code Motion