## A Geometric Approach for Partitioning N-Dimensional Non-Rectangular Iteration Spaces

Citations: | 1 - 0 self |

### BibTeX

@MISC{Kejariwal_ageometric,

author = {Arun Kejariwal and Ru Nicolau and Constantine D. Polychronopoulos},

title = {A Geometric Approach for Partitioning N-Dimensional Non-Rectangular Iteration Spaces},

year = {}

}

### OpenURL

### Abstract

Abstract. Parallel loops account for the greatest percentage of program parallelism. The degree to which parallelism can be exploited and the amount of overhead involved during parallel execution of a nested loop directly depend on partitioning, i.e., the way the different iterations of a parallel loop are distributed across different processors. Thus, partitioning of parallel loops is of key importance for high performance and efficient use of multiprocessor systems. Although a significant amount of work has been done in partitioning and scheduling of rectangular iteration spaces, the problem of partitioning of non-rectangular iteration spaces- e.g. triangular, trapezoidal iteration spaces- has not been given enough attention so far. In this paper, we present a geometric approach for partitioning N-dimensional non-rectangular iteration spaces for optimizing performance on parallel processor systems. Speedup measurements for kernels (loop nests) of linear algebra packages are presented. 1