2026-09-19T11:02:40Z https://opus4.kobv.de/opus4-uni-passau/oai

oai:kobv.de-opus4-uni-passau:100 2025-08-13 bibliography:false doc-type:PhDThesis status-type:publishedVersion open_access ddc ddc:004

Code Optimization in the Polyhedron Model - Improving the Efficiency of Parallel Loop Nests Code-Optimierung im Polyedermodell - Effizienzsteigerung von parallelen Schleifensätzen Peter Faber 004 Polyeder High Performance Fortran Codegenerierung Compiler Nebenläufigkeit Polyedermodell Schleifenparallelisierung OpenMP automatische Parallelisierung optimierende Compiler polyhedron model loop parallelization OpenMP automatic parallelization optimizing compilers 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. Universität Passau Passau Innstrasse 29, 94032 Passau Martin Griebl Priv.-Doz. Dr. 2008-06-25 2008-10-21 PhDThesis Text publishedVersion urn:nbn:de:bvb:739-opus-12512 application/pdf eng Standardbedingung laut Einverständniserklärung thesis.doctoral Universität Passau Passau Fakultät für Informatik und Mathematik 1 https://opus4.kobv.de/opus4-uni-passau/oai/container/index/docId/100 https://opus4.kobv.de/opus4-uni-passau/frontdoor/index/index/docId/100