Paperback Code Optimization In The Polyhedron Model Improving The Efficiency Of Parallel Loop Nests

A safe basis for automatic loop parallelization is the polyhedron model which represents the iteration domain of a loop nest as a polyhedron in an ndimensional integer lattice. 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. This thesis introduces a finegrained model of the computation performed and shows how this model can be applied to cre