Abstract
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 processor/data sets of array elements in the first generalized basic-cycle of the local array it owns. A generalized basic-cycle is defined as lcm(sP, tQ)/(gcd(s,t)×P) in the source distribution and lcm(sP, tQ)/(gcd(s, t)×Q) in the destination distribution. From the source/destination processor/data sets of array elements in the first generalized basic-cycle, we can construct packing/unpacking pattern tables. Based on the packing/unpacking pattern tables, a processor can pack/unpack array elements efficiently. To evaluate the performance of the GBCC method, we have implemented this method on an IBM SP2 parallel machine, along with the PITFALLS method and the ScaLAPACK method. The cost models for these three methods are also presented. The experimental results show that the GBCC method outperforms the PITFALLS method and the ScaLAPACK method for all test samples. A brief description of the extension of the GBCC method to multi-dimensional array redistributions is also presented.
| Original language | English |
|---|---|
| Pages | 640-647 |
| Number of pages | 8 |
| Publication status | Published - 1998 Dec 1 |
| Event | Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS - Tainan, China Duration: 1998 Dec 14 → 1998 Dec 16 |
Other
| Other | Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS |
|---|---|
| City | Tainan, China |
| Period | 98-12-14 → 98-12-16 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture