Work

Efficient algorithms for array redistribution

Year: 1996

Type: article

Abstract: Dynamic redistribution of arrays is required very often in programs on distributed 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 x is 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 x and y. We have implemented these algorithms on the Intel Touchstone Delta, and find that they perform well for different array sizes and number of processors.

Source: IEEE Transactions on Parallel and Distributed Systems

DOI: 10.1109/71.506697

Authors: R. Thakur, A. Choudhary, J. Ramanujam

Institutions: Argonne National Laboratory, Syracuse University, Louisiana State University

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Intel Foundation, Louisiana Board of Regents, California Institute of Technology

OpenAlex ID: W2166816296

FWCI: 6.231

Cites: 21

Cited by: 69

Related to: 9