The Community for Technology Leaders
Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (1997)
San Francisco, CA
Nov. 11, 1997 to Nov. 15, 1997
ISSN: 1089-795X
ISBN: 0-8186-8090-3
pp: 225
Jean-Luc Gaudiot , University of Southern California
Eric Hung-Yu Tseng , University of Southern California
ABSTRACT
We present two elegant techniques for partitioning arrays in parallel DoAll loops for message-passing parallel machines. (1) Communication-free array partitioning: A general solution of communication-free partitioning is derived for arrays in a DoAll loop. The derivation is based on the Smith Normal Form decomposition of the matrix which characterizes the array references in a DoAll loop. (2) One block-communication partitioning: When communication-free partitioning is not possible, we derive the partitioning equations which allocate all remote data to a unique processor. Thus, at most one block-communication is required for each processor to obtain the remote data it needs during computation.
INDEX TERMS
Automatic Array Partitioning, Data Parallelism, Parallel Compiler, Message-Passing, Communication-Free
CITATION
Jean-Luc Gaudiot, Eric Hung-Yu Tseng, "Two Techniques for Static Array Partitioning on Message-Passing Parallel Machines", Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, vol. 00, no. , pp. 225, 1997, doi:10.1109/PACT.1997.644018
91 ms
(Ver 3.3 (11022016))