.png){kind=icon}
Return
Efficient algorithms for array redistribution
.png){kind=icon}
OA
AI
DOI：10.1109/71.506697.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
array redistribution
distributed-memory computers
High Performance Fortran (HPF)
data distribution
runtime support
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
No organization information available
.png){kind=icon}
