<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>100</id>
    <completedYear>2007</completedYear>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>doctoralthesis</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2008-10-21</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>2008-06-25</thesisDateAccepted>
    <title language="eng">Code Optimization in the Polyhedron Model - Improving the Efficiency of Parallel Loop Nests</title>
    <title language="deu">Code-Optimierung im Polyedermodell - Effizienzsteigerung von parallelen Schleifensätzen</title>
    <abstract language="eng">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>
    <identifier type="urn">urn:nbn:de:bvb:739-opus-12512</identifier>
    <identifier type="opus3-id">1251</identifier>
    <licence>Standardbedingung laut Einverständniserklärung</licence>
    <author>Peter Faber</author>
    <subject>
      <language>deu</language>
      <type>swd</type>
      <value>Polyeder</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>swd</type>
      <value>High Performance Fortran</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>swd</type>
      <value>Codegenerierung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>swd</type>
      <value>Compiler</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>swd</type>
      <value>Nebenläufigkeit</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Polyedermodell</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Schleifenparallelisierung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>OpenMP</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>automatische Parallelisierung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>optimierende Compiler</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>polyhedron model</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>loop parallelization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>OpenMP</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>automatic parallelization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>optimizing compilers</value>
    </subject>
    <collection role="ddc" number="004">Datenverarbeitung; Informatik</collection>
    <collection role="open_access" number="">open_access</collection>
    <collection role="institutes" number="">Sonstiger Autor der Fakultät für Informatik und Mathematik</collection>
    <thesisPublisher>Universität Passau</thesisPublisher>
    <thesisGrantor>Universität Passau</thesisGrantor>
    <file>https://opus4.kobv.de/opus4-uni-passau/files/100/Faber_Peter.pdf</file>
  </doc>
</export-example>
