.png){kind=icon}
返回
Message scheduling for array re-decomposition on distributed memory systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2008.10.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For many parallel applications on distributed memory systems, array re-decomposition is usually required to enhance data locality and reduce the communication overheads. How to effectively schedule messages to improve the performance of array re-decomposition has received much attention in recent years. This paper is devoted to develop efficient scheduling algorithms using the compiling information provided by array distribution patterns, array alignment patterns and the periodic property of array accesses. Our algorithms not only avoid inter-processor contention, but also reduces real communication cost and communication generation time. The experimental results show that the performance of array redecomposition can be significantly improved using our algorithms (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
Parallel processing
Array re-decomposition
Array redistribution
Array realignment
Distributed memories
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.8K
被引数:
2.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容