Evaluation of compiler optimizations for Fortran D on MIMD distributed memory machines
ICS '92 Proceedings of the 6th international conference on Supercomputing
Evaluation of compiler generated parallel programs on three multicomputers
ICS '92 Proceedings of the 6th international conference on Supercomputing
A methodology for high-level synthesis of communication on multicomputers
ICS '92 Proceedings of the 6th international conference on Supercomputing
Precise compile-time performance prediction for superscalar-based computers
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
An approach to communication-efficient data redistribution
ICS '94 Proceedings of the 8th international conference on Supercomputing
A Framework for Exploiting Task and Data Parallelism on Distributed Memory Multicomputers
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Compiler optimization of dynamic data distributions for distributed-memory multicomputers
Compiler optimizations for scalable parallel systems
Modeling the impact of run-time uncertainty on optimal computation scheduling using feedback
ICPP '97 Proceedings of the international Conference on Parallel Processing
Exploiting Knowledge of Temporal Behaviour in Parallel Programs for Improving Distributed Mapping
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
The Use of Feedback in Scheduling Parallel Computations
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Linear data distribution based on index analysis
High performance scientific and engineering computing
Modelling message-passing programs for static mapping
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
Message strip-mining heuristics for high speed networks
VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
| Hi-index | 0.00 |
An important problem facing numerous research projects on parallelizing compilers for distributed memory machines is that of automatically determining a suitable data partitioning scheme for a program. Any strategy for automatic data partitioning needs a mechanism for estimating the performance of a program under a given partitioning scheme, the most crucial part of which involves determining the communication costs incurred by the program. The authors describe a methodology for statically estimating the communication times as certain functions of the array sizes and the numbers of processors over which various arrays used are distributed. This work also lays down a framework for effective synthesis of communication on multicomputers from sequential program references.