Publisher's Synopsis
Generating local addresses and communication sets is an important issue in distributed-memory implementations of data-parallel languages such as High Performance Fortran. We show that for an array A affinely aligned to a template that is distributed across p processors with a cyclic(k) distribution, and a computation involving the regular section A, the local memory access sequence for any processor is characterized by a finite state machine of at most k states. We present fast algorithms for computing the essential information about these state machines, and extend the framework to handle multidimensional arrays. We also show how to generate communication sets using the state machine approach. Performance results show that this solution requires very little runtime overhead and acceptable preprocessing time. Chatterjee, Siddhartha and Gilbert, John R. and Long, Fred J. E. and Schreiber, Robert and Teng, Shang-Hua NASA-CR-194605, RIACS-TR-93.03, NAS 1.26:194605 NCC2-387...
