.png){kind=icon}
返回
Parallel divide and conquer on meshes
.png){kind=icon}
PRE
AI
DOI：10.1109/71.539736.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We address the problem of mapping divide-and-conquer programs to mesh connected multicomputers with wormhole or store-and-forward routing, We propose the binomial tree as an efficient model of parallel divide-and-conquer and present two mappings of the binomial tree to the 2D mesh. Our mappings exploit regularity in the communication structure of the divide-and-conquer computation and are also sensitive to the underlying flow control scheme of the target architecture. We evaluate these mappings using new metrics which are extensions of the classical notions of dilation and contention. We introduce the notion of communication slowdown as a measure of the total communication overhead incurred by a parallel computation. We conclude that significant performance gains can be realized when the mapping is sensitive to the flow control scheme of the target architecture.
Keyword:
mapping
embedding
divide-and-conquer algorithms
binomial tree
mesh connected machines
routing
wormhole routing
store-and-forward routing
contention, dilation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
Modification of cellulose model surfaces by cationic polymer latexes prepared by RAFT-mediated surfactant-free emulsion polymerization.png)
Polym. Chem.
OAAI
Polym. Chem.IF0
OAAI分享收藏分享收藏 没有更多内容
没有更多内容