Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"Common Subexpression Elimination"”.

  1. Impact of the LZW-based common subexpression elimination algorithm on SAT-solving efficiency

    … This research investigates how the removal of common subexpressions in a formula via the Lempel–Ziv-Welch (LZW)-based approach can affect the efficiency of SAT solving. By substituting common subexpressions for new variables in the original formula, we compare the results of passing the …

    ttu Repository record for Impact of the LZW-based common subexpression elimination algorithm on SAT-solving efficiency (opens in a new tab)

  2. SIMPLIFYING CODE GENERATION THROUGH PEEPHOLE OPTIMIZATION

    … optimizations, such as register allocation, common subexpression elimination, and removal of unreachable code, may be done more thoroughly and completely when information about the target machine is available.

    arizona-thes Repository record for SIMPLIFYING CODE GENERATION THROUGH PEEPHOLE OPTIMIZATION (opens in a new tab)

  3. Automatic determination of may/must set usage in data-flow analysis

    Data-flow analysis is a common technique for gathering program information for use in performance improving transformations such as register allocation, deadcode elimination, common subexpression elimination, and scheduling. Current tools for generating data-flow analysis implementations enable …

    colostate Repository record for Automatic determination of may/must set usage in data-flow analysis (opens in a new tab)

  4. INCREMENTAL COMPUTATION OF TAYLOR SERIES AND SYSTEM JACOBIAN IN DAE SOLVING USING AUTOMATIC DIFFERENTIATION

    … of the number of stages. We also develop a common subexpression elimination (CSE) method to build a compact computational graph through operator overloading. The CSE method is of linear time complexity, which makes it suitable as a preprocessing step for general operator overloaded …

    mcmaster Repository record for INCREMENTAL COMPUTATION OF TAYLOR SERIES AND SYSTEM JACOBIAN IN DAE SOLVING USING AUTOMATIC DIFFERENTIATION (opens in a new tab)

  5. Type-Safe Modeling for Optimization

    … with a hashed indexing scheme to implement common subexpression elimination (CSE). It abstracts away details of the underlying lookup table via monadic type class instances. We explain how using symbolic expressions with CSE enables performance-enhance transformations and automatic …

    mcmaster Repository record for Type-Safe Modeling for Optimization (opens in a new tab)

  6. A compiler optimization framework for Concordia parallel C

    … example, we showed how to solve the Common Subexpression Elimination (CSE) problem using the optimization framework. To make our optimization framework general yet efficient, we pay special attention on data structures used in our implementation. Sets are the common data structure …

    concordia Download PDF for A compiler optimization framework for Concordia parallel C (opens in a new tab)

  7. Compiling SA-C to reconfigurable computing systems

    … are primarily conventional optimizations such as common subexpression elimination and constant folding. The loop restructuring optimizations include loop unrolling, stripmining and fusion, applied as DDCF-to-DDCF transformations using window generators. The compiler, after performing …

    colostate Repository record for Compiling SA-C to reconfigurable computing systems (opens in a new tab)