当前位置: X-MOL 学术Analele Univ. Ovidius Constanta - Ser. Mat. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Code generation approaches for parallel geometric multigrid solvers
Analele Universitatii "Ovidius" Constanta - Seria Matematica ( IF 0.8 ) Pub Date : 2020-12-01 , DOI: 10.2478/auom-2020-0038
Harald Köstler , Marco Heisig , Nils Kohl , Sebastian Kuckuk , Martin Bauer , Ulrich Rüde

Abstract Software development for applications in computational science and engineering has become complex in recent years. This is mainly due to the increasing parallelism and heterogeneity in modern computer architectures and to the more realistic physical and mathematical models that have to be processed. One idea to address this issue is to use code generation techniques. In contrast to manual implementations in a general-purpose computing language, they allow to integrate automatic code transforms to produce efficient code for different models and platforms. As an example the numerical solution of an elliptic partial differential equation via generated geometric multigrid solvers is considered. We present three code generation approaches for it and discuss their advantages and disadvantages with respect to performance, portability, and productivity.

中文翻译:

并行几何多重网格求解器的代码生成方法

摘要 近年来,用于计算科学和工程应用的软件开发变得复杂。这主要是由于现代计算机体系结构中日益增加的并行性和异构性以及必须处理的更现实的物理和数学模型。解决这个问题的一个想法是使用代码生成技术。与通用计算语言中的手动实现相比,它们允许集成自动代码转换以生成适用于不同模型和平台的高效代码。作为一个例子,考虑通过生成的几何多重网格求解器对椭圆偏微分方程的数值解。我们为它介绍了三种代码生成方法,并讨论了它们在性能、可移植性、
更新日期:2020-12-01
down
wechat
bug