返回
A new parallelization scheme for adaptive mesh refinement
DOI:10.1016/j.jocs.2016.05.003.png)
摘要
En 中文
We present a new method for parallelization of adaptive mesh refinement called Concurrent Structured Adaptive Mesh Refinement (CSAMR). This new method offers the lower computational cost (i.e. wall time x processor count) of subcycling in time, but with the runtime performance (i.e. smaller wall time) of evolving all levels at once using the time step of the finest level (which does more work than subcycling but has less parallelism). We demonstrate our algorithm's effectiveness using an adaptive mesh refinement code, AMSS-NCKU, and show performance on Blue Waters and other high performance clusters. For the class of problem considered in this paper, our algorithm achieves a speedup of 1.7-1.9 when the processor count for a given AMR run is doubled, consistent with our theoretical predictions. (C) 2016 The Authors. Published by Elsevier B.V.
Keyword:
Parallel application frameworks
Parallel algorithms
Parallel applications
Adaptive mesh refinement
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
18.3
论文数:
3.1K
被引数:
4.0K
机构
引用论文
A survey of high level frameworks in block-structured adaptive mesh refinement packages块结构自适应网格细化包中的高级框架综述

