{"id":{"repo_id":"passau-thes","oai_identifier":"oai:kobv.de-opus4-uni-passau:100"},"canonical_url":"https://search.dev.ndltd.org/etd/passau-thes/oai:kobv.de-opus4-uni-passau:100","repository":{"repo_id":"passau-thes","name":"Universität Passau","base_url":"https://opus4.kobv.de/opus4-uni-passau/oai"},"display":{"title":"Code Optimization in the Polyhedron Model - Improving the Efficiency of Parallel Loop Nests","abstract":"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.","abstract_html":"A safe basis for automatic loop parallelization is the polyhedron model which represents the iteration domain of a loop nest as a polyhedron in <span class=\"etd-inline-math\">\\mathbb{Z}<sup>n</sup></span>. 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.","abstract_has_math":true,"creators":["Faber, Peter"],"institution":"Universität Passau","degree_name":null,"degree_level":"thesis.doctoral","degree_discipline":null,"degree_department":null,"school":null,"contributors":["Griebl, Martin"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2008,"date_issued":"2008-06-25","date_published":"2008-06-25","updated_at":"2026-07-24T03:44:57Z","subjects":["Polyedermodell","Schleifenparallelisierung","OpenMP","automatische Parallelisierung","optimierende Compiler","polyhedron model","loop parallelization","automatic parallelization","optimizing compilers"],"languages":[],"rights":["Standardbedingung laut Einverständniserklärung"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://opus4.kobv.de/opus4-uni-passau/frontdoor/index/index/docId/100","outbound_label":"Repository record","outbound_source":"source_url"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Griebl, Martin"]},{"key":"dc:creator","label":"Author","values":["Faber, Peter"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:publisher","label":"Institution","values":["Universität Passau"]},{"key":"dc:type","label":"Dc Type","values":["doctoralThesis"]},{"key":"thesis:degree_level","label":"Degree Level","values":["thesis.doctoral"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Universität Passau"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Polyedermodell","Schleifenparallelisierung","OpenMP","automatische Parallelisierung","optimierende Compiler","polyhedron model","loop parallelization","automatic parallelization","optimizing compilers"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["Standardbedingung laut Einverständniserklärung"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Code Optimization in the Polyhedron Model - Improving the Efficiency of Parallel Loop Nests","Code-Optimierung im Polyedermodell - Effizienzsteigerung von parallelen Schleifensätzen"]}]}],"canonical_facts":{"dc:contributor":["Griebl, Martin"],"dc:creator":["Faber, Peter"],"dc:description.abstract":["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."],"dc:format.medium":["application/pdf"],"dc:publisher":["Universität Passau"],"dc:rights":["Standardbedingung laut Einverständniserklärung"],"dc:subject":["Polyedermodell","Schleifenparallelisierung","OpenMP","automatische Parallelisierung","optimierende Compiler","polyhedron model","loop parallelization","automatic parallelization","optimizing compilers"],"dc:title":["Code Optimization in the Polyhedron Model - Improving the Efficiency of Parallel Loop Nests","Code-Optimierung im Polyedermodell - Effizienzsteigerung von parallelen Schleifensätzen"],"dc:type":["doctoralThesis"],"thesis:degree_level":["thesis.doctoral"],"thesis:institution_name":["Universität Passau"]},"updated_at":"2026-07-24T03:44:57Z"}