Benchmarking Domain-Specific Compiler Optimizations for Variational Forms
arXiv:1205.3027 · doi:10.1145/1377612.1377614
Abstract
We examine the effect of using complexity-reducing relations to generate optimized code for the evaluation of finite element variational forms. The optimizations are implemented in a prototype code named FErari, which has been integrated as an optimizing backend to the FEniCS Form Compiler, FFC. In some cases, FErari provides very little speedup, while in other cases, we obtain reduced local operation counts of a factor of as much as 7.9 and speedups for the assembly of the global sparse matrix of as much as a factor of 2.8.
ACM Transactions on Mathematical Software 35(2), 18 pages (2008)
References in corpus (4)
Cited by in corpus (5)
- Optimisations for quadrature representations of finite element tensors through automated code generation
- Efficient Assembly of H(div) and H(curl) Conforming Finite Elements
- Automated code generation for discontinuous Galerkin methods
- A Traveling-Wave Solution for Bacterial Chemotaxis with Growth
- A FEniCS-Based Programming Framework for Modeling Turbulent Flow by the Reynolds-Averaged Navier-Stokes Equations