Automatic decomposition in EPPP compiler

Authors:
Qi Ning;Vincent Van Dongen;Guang R. Gao
Affiliations:
Centre de Recherche Informatique de Montréal, 1801 McGill Avenue, Bureau 800, Montreal, Quebec, Canada H3A 2N4;Centre de Recherche Informatique de Montréal, 1801 McGill Avenue, Bureau 800, Montreal, Quebec, Canada H3A 2N4;School of Computer Science, McGill University, Montreal, Quebec, Canada H3A 2A7
Venue:
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
Year:
1994

Citing 5
Cited 0

Global optimizations for parallelism and locality on scalable parallel machines

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Communication optimization and code generation for distributed memory machines

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Toward automatic partitioning of arrays on distributed memory computers

ICS '93 Proceedings of the 7th international conference on Supercomputing
An Overview of a Compiler for Scalable Parallel Machines

Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we give an overview of our automatic computation and data decomposition scheme in the EPPP compiler for distributed memory machines. Such automatic techniques can also be used in compilers for programming languages such as HPF (High-Performance Fortran) in conjunction with the user-specified data distribution directives. A pilot EPPP compiler has been implemented and preliminary results on a target distributed memory architecture (the IBM SP-1 system) are reported which demonstrate encouraging speedups of the code generated by the automatic decomposition scheme.