Program partitioning optimizations in an HPF prototype compiler

Two kinds of program partitioning optimizations are proposed. The first extends program partitioning using array subscript functions to deal with two cases about array elements on the left hand side of assignment statements in the loop: (a) the same loop control variables exist in different dimensions, (b) plural loop control variables exist in one dimension. The second removes statement guards generated in a loop by program partitioning in two cases about loop iteration ranges of statements in the loop: (c) ranges of plural statements for one processor are potentially different, (d) ranges of one statement for plural processors are potentially different. The first is proved to be efficient for the BEM program. The second is implemented in a simplified way in our HPF prototype compiler, and compiler output to Shallow Water program has as good performance as a hand optimized one