Automatic array alignment as a step in hierarchical program transformation

Presents an original approach to automatic array alignment, the step in the hierarchical transformation system aimed at the efficient execution of shared memory programs on distributed memory machines. The array alignment algorithm deals with a broad set of intra-dimension and inter-dimension alignment preferences, including offsets, strides, permutations, embeddings, and their combinations. The authors discuss the algorithm and the tests performed on the Connection Machine CM-2.<
>