A systematic approach to synthesize data alignment directives for distributed memory machines

Authors:
Chih-Zong Lin;Chien-Chao Tseng;Yi-Lin Chen;Tso-Wei Kuo
Affiliations:
Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 30050 Taiwan ROC;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 30050 Taiwan ROC;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 30050 Taiwan ROC;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 30050 Taiwan ROC
Venue:
Nordic Journal of Computing
Year:
1996

Citing 10
Cited 0

Memory storage patterns in parallel processing

Memory storage patterns in parallel processing
Transputer development system (2nd ed.)

Transputer development system (2nd ed.)
Generating explicit communication from shared-memory program references

Proceedings of the 1990 ACM/IEEE conference on Supercomputing
The data alignment phase in compiling programs for distributed-memory machines

Journal of Parallel and Distributed Computing
The NAS parallel benchmarks—summary and preliminary results

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Compiling Fortran D for MIMD distributed-memory machines

Communications of the ACM
Iteration space tiling for distributed memory machines

Languages, compilers and run-time environments for distributed memory machines
Automatic data mapping for distributed-memory parallel computers

ICS '92 Proceedings of the 6th international conference on Supercomputing
On the parallelization of global spectral weather models

Parallel Computing
Demonstration of Automatic Data Partitioning Techniques for Parallelizing Compilers on Multicomputers

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a systematic method to synthesize the alignment and realignment directives for data-parallel languages. By using several heuristic rules, this method can determine the multiple alignment relation of the given program. This method can be carried out in polynomial time. An NAS parallel benchmark program was selected as a benchmark and compiled for execution on a Transputer system. The result shows that the execution time of the multiple alignment version of the given program obtained by the proposed method is smaller than the single alignment version of the given program.