arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1506.04496cs.MS
收藏

Peano软件-并行、基于自动机、动态自适应网格遍历

The Peano software - parallel, automaton-based, dynamically adaptive grid traversals

Tobias Weinzierl

摘要:

我们讨论的设计决策,设计方案和背后的第三代皮亚诺,动态自适应笛卡尔网格来自空间树的框架的基本原理。Peano将网格遍历绑定到网格存储,并且仅支持由空间填充曲线产生的一个元素遍历顺序。用户不能自由选择遍历顺序。遍历可以利用规则的网格子区域和共享内存以及分布式内存系统,几乎不需要修改串行应用程序代码。我们通过两个相互作用的自动机形式化的软件设计-一个自动机的多尺度网格遍历和一个特定于应用程序的算法步骤。这产生了一个基于回调的编程范例。在详细介绍高性能计算方面和经验教训之前,我们将进一步概述支持的应用程序类型和实现的两种数据存储方案。特别强调的是放在观察有关使用的编程习惯和算法的概念。这将我们的报告从“一种实现事物的方式”的代码描述转换为对任何基于树的自适应网格细化软件的一些替代方案、原理和设计决策的一般性讨论和总结。

英文摘要:

We discuss the design decisions, design alternatives and rationale behind the third generation of Peano, a framework for dynamically adaptive Cartesian meshes derived from spacetrees. Peano ties the mesh traversal to the mesh storage and supports only one element-wise traversal order resulting from space-filling curves. The user is not free to choose a traversal order herself. The traversal can exploit regular grid subregions and shared memory as well as distributed memory systems with almost no modifications to a serial application code. We formalize the software design by means of two interacting automata---one automaton for the multiscale grid traversal and one for the application-specific algorithmic steps. This yields a callback-based programming paradigm. We further sketch the supported application types and the two data storage schemes realized, before we detail high-performance computing aspects and lessons learned. Special emphasis is put on observations regarding the used programming idioms and algorithmic concepts. This transforms our report from a "one way to implement things" code description into a generic discussion and summary of some alternatives, rationale and design decisions to be made for any tree-based adaptive mesh refinement software.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑