Memory storage patterns in parallel processing
Memory storage patterns in parallel processing
The systematic design of systolic arrays
Centre National de Recherche Scientifique on Automata networks in computer science: theory and applications
Data optimization: allocation of arrays to reduce communication on SIMD machines
Journal of Parallel and Distributed Computing - Massively parallel computation
Automatic data mapping for distributed-memory parallel computers
ICS '92 Proceedings of the 6th international conference on Supercomputing
Computability of recurrence equations
Theoretical Computer Science
Some efficient solutions to the affine scheduling problem: I. One-dimensional time
International Journal of Parallel Programming
Compile-Time Techniques for Data Distribution in Distributed Memory Machines
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Automatic decomposition in EPPP compiler
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
IEEE Transactions on Parallel and Distributed Systems
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
This paper considers the problem of distributing data and code among the processors of a distributed memory supercomputer. Provided that the source program is amenable to detailed dataflow analysis, one may determine a placement function by an algorithm analogous to Gaussian elimination. Such a function completely characterizes the distribution by giving the identity of the virtual processor on which each elementary calculation is executed. One has then to “realize” the virtual processors on the PE. The resulting structure satisfies the “owner computes” rule and is reminiscent of two-level distribution schemes, like HPF's ALIGN and DISTRIBUTE directives, or the CM-2 virtual processor system.