TY - THES A1 - Faber, Peter T1 - Code Optimization in the Polyhedron Model - Improving the Efficiency of Parallel Loop Nests T1 - Code-Optimierung im Polyedermodell - Effizienzsteigerung von parallelen Schleifensätzen N2 - A safe 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 seriously -- especially on distributed memory architectures. We introduce a fine-grained model of the computation performed and show how this model can be applied to create efficient code. KW - Polyeder KW - High Performance Fortran KW - Codegenerierung KW - Compiler KW - Nebenläufigkeit KW - Polyedermodell KW - Schleifenparallelisierung KW - OpenMP KW - automatische Parallelisierung KW - optimierende Compiler KW - polyhedron model KW - loop parallelization KW - OpenMP KW - automatic parallelization KW - optimizing compilers Y1 - 2008 UR - https://opus4.kobv.de/opus4-uni-passau/frontdoor/index/index/docId/100 UR - https://nbn-resolving.org/urn:nbn:de:bvb:739-opus-12512 ER -