Simplifying reductions

We present optimization techniques for high level equational programs that are generalizations of affine control loops (ACLs). Significant parts of the SpecFP and PerfectClub benchmarks are ACLs. They often contain reductions: associative and commutative operators applied to a collection of values. They also often exhibit reuse: intermediate values computed or used at different index points being identical. We develop various techniques to automatically exploit reuse to simplify the computational complexity of evaluating reductions. Finally, we present an algorithm for the optimal application of such simplifications resulting in an equivalent specification with minimum complexity.

• Type: Conference
• Year: 2006
• Where: POPL
• Authors: Gautam Gupta, Sanjay V. Rajopadhye
• Keywords: Affine Control, Level Equational Programs, POPL 2006, Programming Languages, Significant Parts