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 3 of 3 for “"polyhedron model"”.

  1. Iterative Schedule Optimization for Parallelization in the Polyhedron Model

    … programs and target hardware than static cost models and heuristics. Thereby, iterative compilation helps in situations in which static heuristics do not reflect the combination of input program and target hardware well. Moreover, iterative compilation may enable the derivation of more accurate …

    passau-thes Repository record for Iterative Schedule Optimization for Parallelization in the Polyhedron Model (opens in a new tab)

  2. Code Optimization in the Polyhedron Model - Improving the Efficiency of Parallel Loop Nests

    … basis for automatic loop parallelization is the polyhedron model which represents the iteration domain of a loop nest as a polyhedron in $\mathbb{Z}^n$. However, turning the parallel loop program in the model to efficient code meets with several obstacles, due to which performance may deteriorate …

    passau-thes Repository record for Code Optimization in the Polyhedron Model - Improving the Efficiency of Parallel Loop Nests (opens in a new tab)

  3. The Challenges of Non-linear Parameters and Variables in Automatic Loop Parallelisation

    … We aim at extending the well-known polyhedron model, which promises this automation, beyond some of its current restrictions. Up to now, loop bounds and array subscripts in the modelled codes must be expressions linear in both the variables and the parameters. We lift this …

    passau-thes Repository record for The Challenges of Non-linear Parameters and Variables in Automatic Loop Parallelisation (opens in a new tab)