Efficient Implementation of Multi-Dimensional Array Redistribution
Summary :
Array redistribution is required very often in programs on distributed memory parallel computers. It is essential to use efficient algorithms for redistribution, otherwise the performance of programs may degrade considerably. In this paper, we focus on automatic generation of communication routines for multi-dimensional redistribution. The principal advantage of this work is to gain the ability to handle redistribution between arbitrary source and destination processor sets and between arbitrary source and destination distribution schemes. We have implemented these algorithms using Parallelware communication library. Some experimental results show the efficiency and flexibility of our techniques compared to the other redistribution works.
- Publication
- IEICE TRANSACTIONS on Information Vol.E81-D No.11 pp.1195-1204
- Publication Date
- 1998/11/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Sofware System
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Minyi GUO, Yoshiyuki YAMASHITA, Ikuo NAKATA, "Efficient Implementation of Multi-Dimensional Array Redistribution" in IEICE TRANSACTIONS on Information,
vol. E81-D, no. 11, pp. 1195-1204, November 1998, doi: .
Abstract: Array redistribution is required very often in programs on distributed memory parallel computers. It is essential to use efficient algorithms for redistribution, otherwise the performance of programs may degrade considerably. In this paper, we focus on automatic generation of communication routines for multi-dimensional redistribution. The principal advantage of this work is to gain the ability to handle redistribution between arbitrary source and destination processor sets and between arbitrary source and destination distribution schemes. We have implemented these algorithms using Parallelware communication library. Some experimental results show the efficiency and flexibility of our techniques compared to the other redistribution works.
URL: https://global.ieice.org/en_transactions/information/10.1587/e81-d_11_1195/_p
Copy
@ARTICLE{e81-d_11_1195,
author={Minyi GUO, Yoshiyuki YAMASHITA, Ikuo NAKATA, },
journal={IEICE TRANSACTIONS on Information},
title={Efficient Implementation of Multi-Dimensional Array Redistribution},
year={1998},
volume={E81-D},
number={11},
pages={1195-1204},
abstract={Array redistribution is required very often in programs on distributed memory parallel computers. It is essential to use efficient algorithms for redistribution, otherwise the performance of programs may degrade considerably. In this paper, we focus on automatic generation of communication routines for multi-dimensional redistribution. The principal advantage of this work is to gain the ability to handle redistribution between arbitrary source and destination processor sets and between arbitrary source and destination distribution schemes. We have implemented these algorithms using Parallelware communication library. Some experimental results show the efficiency and flexibility of our techniques compared to the other redistribution works.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Efficient Implementation of Multi-Dimensional Array Redistribution
T2 - IEICE TRANSACTIONS on Information
SP - 1195
EP - 1204
AU - Minyi GUO
AU - Yoshiyuki YAMASHITA
AU - Ikuo NAKATA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E81-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 1998
AB - Array redistribution is required very often in programs on distributed memory parallel computers. It is essential to use efficient algorithms for redistribution, otherwise the performance of programs may degrade considerably. In this paper, we focus on automatic generation of communication routines for multi-dimensional redistribution. The principal advantage of this work is to gain the ability to handle redistribution between arbitrary source and destination processor sets and between arbitrary source and destination distribution schemes. We have implemented these algorithms using Parallelware communication library. Some experimental results show the efficiency and flexibility of our techniques compared to the other redistribution works.
ER -
English
