.png){kind=icon}
.png){kind=icon}
Return
Efficient Data Redistribution Algorithms From Irregular to Block Cyclic Data Distribution
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2022.3166484.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose some efficient data redistribution algorithms for redistributing matrices from 1D or 2D irregular format to block cyclic data distribution (BCDD) format, which can be much faster than the BLACS routine PXGEMR2D. These algorithms can be used to combine direct methods with iterative methods. The proposed algorithms divide the communication into two phases: one for processes in the same column and the other for processes in the same row, and the whole data redistribution task is divided into several independent sub-communications. The communication time can be reduced a lot compared with BLACS. Performance results show that our algorithms can be 2x-5x faster than the BLACS routine PXGEMR2D when using 4096 processes and the experiments are performed on Tianhe-2A supercomputer.
Keywords:
BLACS
data redistribution
irregular data
scalapack
BCDD
exascale computing
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W