Efficient algorithms for array redistribution

Rajeev Thakur

doi:10.1109/71.506697

Efficient algorithms for array redistribution

1996-06-01

37

OA

AI

DOI：10.1109/71.506697

原文链接

查看原文

摘要

En 中文

Dynamic redistribution of arrays is required very often in programs on distributed memory parallel computers. This paper presents efficient algorithms for redistribution between different cyclic(k) distributions, as defined in High Performance Fortran. We first propose special optimized algorithms for a cyclic(x) to cyclic(y) redistribution when xis a multiple of y, or y is a multiple of x. We then propose two algorithms, called the GCD method and the LCM method, for the general cyclic(x) to cyclic(y) redistribution when there is no particular relation between rand y. We have implemented these algorithms on the Inter Touchstone Delta, and find that they perform well for different array sizes and number of processors.

Keyword:

array redistribution

distributed-memory computers

High Performance Fortran (HPF)

data distribution

runtime support

Efficient algorithms for array redistribution

摘要

AI总结

期刊

机构

引用论文