@phdthesis{Faber2007, author = {Faber, Peter}, title = {Code Optimization in the Polyhedron Model - Improving the Efficiency of Parallel Loop Nests}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:739-opus-12512}, school = {Universit{\"a}t Passau}, year = {2007}, 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.}, subject = {Polyeder}, language = {en} }