Run-time automatic instantiation of algorithms using C++ templates

Authors:
T. Quintino;H. Deconinck
Affiliations:
Aerospace and Aeronautics Department, von Karman Institute for Fluid Dynamics, 72 Chaussee de Waterloo, 1640 St-Genesius-Rode, Belgium.;Aerospace and Aeronautics Department, von Karman Institute for Fluid Dynamics, 72 Chaussee de Waterloo, 1640 St-Genesius-Rode, Belgium
Venue:
International Journal of Computational Science and Engineering
Year:
2009

Citing 10
Cited 0

A set of level 3 basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
Design patterns: elements of reusable object-oriented software

Design patterns: elements of reusable object-oriented software
Generative programming: methods, tools, and applications

Generative programming: methods, tools, and applications
Dynamic Class Loading in C++

Linux Journal
Will C++ Be Faster than Fortran?

ISCOPE '97 Proceedings of the Scientific Computing in Object-Oriented Parallel Environments
Toward a Common Component Architecture for High-Performance Scientific Computing

HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
On the performance of the Python programming language for serial and parallel scientific computations

Scientific Programming
deal.II—A general-purpose object-oriented finite element library

ACM Transactions on Mathematical Software (TOMS)
Reusable object-oriented solutions for numerical simulation of PDEs in a high performance environment

Scientific Programming - Parallel/High-Performance Object-Oriented Scientific Computing (POOSC '05), Glasgow, UK, 25 July 2005
Python Scripting for Computational Science

Python Scripting for Computational Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithms for scientific computations implemented with template C++ code are both generic and highly efficient. Nevertheless, once compiled, they become statically bound to some functionality. To allow the end-user to change functionality and configure the algorithms with external policies they must retain their generality at run-time. For this purpose, we introduce a technique that uses delayed run-time instantiation of C++ template algorithms. It generates code from a predefined collection of algorithms, configured with policy classes chosen at run-time. The code is then compiled into a dynamically library that is loaded on demand by the end-user into the scientific simulation tool.