Optimization of Array Redistribution for Distributed Memory Multicomputers

Abstract

Languages such as High Performance Fortran implement parallel algorithms by distributing large data structures across a multicomputer system. To enhance parallelism and reduce communication, it is sometimes bene cial for a programmer to change the distribution between phases of the algorithm. We introduce a new mapping strategy, called the spiral mapping, that reduces the communication overhead of array redistribution. Redistribution using the spiral mapping exploits communication locality and reduces global communication con icts. We implemented redistribution using the standard linear mapping and the spiral mapping for two dimensional arrays; for 1024 1024 arrays, redistribution using the spiral mapping is 36% faster than using the linear mapping on a 16 node Intel iPSC/860.

DOI: 10.1016/0167-8191(95)00027-L

Extracted Key Phrases

1 Figure or Table

Statistics

01020'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

56 Citations

Semantic Scholar estimates that this publication has 56 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Wakatani1995OptimizationOA, title={Optimization of Array Redistribution for Distributed Memory Multicomputers}, author={Akiyoshi Wakatani and Michael Wolfe}, journal={Parallel Computing}, year={1995}, volume={21}, pages={1485-1490} }