.png){kind=icon}
返回
Scheduling block-cyclic array redistribution
.png){kind=icon}
OA
AI
DOI：10.1109/71.663945.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article is devoted to the run-time redistribution of one-dimensional arrays that are distributed in a block-cyclic fashion over a processor grid. While previous studies have concentrated on efficiently generating the communication messages to be exchanged by the processors involved in the redistribution, we focus on the scheduling of those messages: how to organize the message exchanges into structured communication steps that minimize contention. We build upon results of Walker and Otto, who solved a particular instance of the problem, and we derive an optimal scheduling for the most general case, namely, moving from a CYCLIC (r) distribution on a P-processor grid to a CYCLIC (s) distribution on a Q-processor grid, for arbitrary values of the redistribution parameters P, Q, r, and s.
Keyword:
distributed arrays
redistribution
block-cyclic distribution
scheduling
MPI
HPF
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
分享收藏Auditory Space Perception in the Blind: Horizontal Sound Localization in Acoustically Simple and Complex Situations.png)
Perception
PerceptionIF0
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容