CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Benchmarking domain-specific compiler optimizations for variational forms

R.C. Kirby ; Anders Logg (Institutionen för matematiska vetenskaper, matematik)
ACM Transactions on Mathematical Software (0098-3500). Vol. 35 (2008), 2,
[Artikel, refereegranskad vetenskaplig]

We examine the effect of using complexity-reducing relations [Kirby et al. 2006] 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 [Kirby and Logg 2006; 2007]. In some cases, FErari provides very little speedup, while in other cases we obtain reduced local operation counts by a factor of as much as 7.9 and speedups for the assembly of the global sparse matrix by as much as a factor of 2.8 (see Figure 9). © 2008 ACM.

Nyckelord: Compiler , Complexity-reducing relations , FErari , FFC , Finite element method , Optimization , Variational form



Denna post skapades 2014-01-05. Senast ändrad 2014-09-29.
CPL Pubid: 191165

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för matematiska vetenskaper, matematik (2005-2016)

Ämnesområden

Matematik
Beräkningsmatematik

Chalmers infrastruktur