.png){kind=icon}
返回
Fast runtime block cyclic data redistribution on multiprocessors
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1997.1351.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Block cyclic distribution seems to be well suited for most linear algebra algorithms, and this type of data distribution was chosen for the ScaLAPACK library as well as for the HPF language, However, one must choose a good compromise for the size of the blocks (to achieve a good computation and communication efficiency and a good load balancing), This choice heavily depends on each operation, so it is essential to be able to go from one block cyclic distribution to another very quickly. Moreover, it is also essential to be able to choose the right number of processors and the best grid shape for a given operation, We present here the data redistribution algorithms we implemented in the ScaLAPACK library in order to go from one block cyclic distribution on one grid to that on another grid, A complexity study is made that shows the efficiency of our solution, Timing results on the Intel Paragon and the Gray T3D corroborate our results. (C) 1997 Academic Press.
Keyword:
COMMUNICATION
PERFORMANCE
COMPUTERS
DESIGN
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
分享收藏Auditory Space Perception in the Blind: Horizontal Sound Localization in Acoustically Simple and Complex Situations.png)
Perception
PerceptionIF0
PREAI
分享收藏Grid search method optimization for indoor visible light localization by support vector machines
IF0
PREAI
分享收藏
没有更多内容
没有更多内容