next up previous
Next: Introduction

Compile-Time Partitioning of Three-Dimensional Iteration Spaces

Rizos Sakellariou1


This paper presents a strategy for compile-time partitioning of generalised three-dimensional iteration spaces; it can be applied to loop nests comprising two inner nested loops both of which have bounds linearly dependent on the index of the outermost parallel loop. The strategy is analysed using symbolic analysis techniques for enumerating loop iterations which can provide estimates for the load imbalance, and experimentally evaluated on a virtual shared memory parallel computer.

Rizos Sakellariou 2000-11-12