Location of Repository

Optimizing Expression Selection for Lookup Table Program Transformation

By Chris Wilcox, Michelle Mills Strout and James M. Bieman

Abstract

Abstract—Scientific programmers can speed up function evaluation by precomputing and storing function results in lookup table (LUTs), thereby replacing costly evaluation code with an inexpensive memory access. A code transform that replaces computation with LUT code can improve performance, however, accuracy is reduced because of error inherent in reconstructing values from LUT data. LUT transforms are commonly used to approximate expensive elementary functions. The current practice is for software developers to (1) manually identify expressions that can benefit from a LUT transform, (2) modify the code by hand to implement the LUT transform, and (3) run experiments to determine if the resulting error is within application requirements. This approach reduces productivity, obfuscates code, and limits programmer control over accuracy and performance. We propose source code analysis and program transformation to substantially automate the application of LUT transforms. Our approach uses a novel optimization algorithm that selects Pareto optimal sets of expressions that benefit most from LUT transformation, based on error and performance estimates. We demonstrate our methodology with the Mesa tool, which achieves speedups of 1.4-6.9 × on scientific codes while managing introduced error. Our tool makes the programmer more productive and improves the chances of finding an effective solution. Keywords-lookup table; performance optimization; error analysis; code generation; scientific computing; memoization; fuzzy reuse; Mesa tool I

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.298.253
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.colostate.edu/~m... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.