Efficient algorithms for array redistribution
نویسندگان
چکیده
منابع مشابه
Efficient Algorithms for Array Redistribution
Dynamic redistribution of arrays is required very often in programs on distributed memory parallel computers. This paper presents eecient algorithms for redistribution between diierent cyclic(k) distributions, as deened in High Performance Fortran. We rst 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 ...
متن کاملEecient Algorithms for Block-cyclic Array Redistribution between Processor Sets
Run-time array redistribution is necessary to enhance the performance of parallel programs on distributed memory supercomputers. In this paper, we present an eecient algorithm for array redistribution from cyclic(x) on P processors to cyclic(Kx) on Q processors. The algorithm reduces the overall time for communication by considering the data transfer, communication schedule, and index computati...
متن کاملA Generalized Basic Cycle Calculation Method for Efficient Array Redistribution
ÐIn many scientific applications, dynamic array redistribution is usually required to enhance the performance of an algorithm. In this paper, we present a generalized basic-cycle calculation (GBCC) method to efficiently perform a BLOCK-CYCLIC(s) over P processors to BLOCK-CYCLIC(t) over Q processors array redistribution. In the GBCC method, a processor first computes the source/destination proc...
متن کاملMulti-Phase Redistribution: A Communication-Efficient Approach to Array Redistributionz
Distributed-memory implementations of several scientific applications require array redistribution. Array redistribution is used in languages such as High Performance Fortran to dynamically change the distribution of arrays across processors. Performing array redistribution incurs two overheads an indexing overhead for determining the set of processors to communicate with and the array elements...
متن کاملImproving communication scheduling for array redistribution
Many scientific applications require array redistribution when the programs run on distributed memory parallel computers. It is essential to use efficient algorithms for redistribution, otherwise the performance of the programs will degrade considerably. The redistribution overheads consist of two parts: index computation and inter-processor communication. If there is no communication schedulin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1996
ISSN: 1045-9219
DOI: 10.1109/71.506697