.png){kind=icon}
返回
Performance of parallel computations with dynamic processor allocation
.png){kind=icon}
PRE
AI
DOI：10.1007/s00366-007-0078-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In parallel adaptive mesh refinement (AMR) computations the problem size can vary significantly during a simulation. The goal here is to explore the performance implications of dynamically varying the number of processors proportional to the problem size during simulation. An emulator has been developed to assess the effects of this approach on parallel communication, parallel runtime and resource consumption. The computation and communication models used in the emulator are described in detail. Results using the emulator with different AMR strategies are described for a test case. Results show for the test case, varying the number of processors, on average, reduces the total parallel communications overhead from 16 to 19% and improves parallel runtime time from 4 to 8%. These results also show that on average resource utilization improves more than 37%.
Keyword:
adaptive mesh refinement (AMR)
resource utilization
parallel performance
dynamic processor allocation
modelling parallel computations
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
2.6K
被引数:
9.3K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
分享收藏
查看更多内容