Fastsg: A fast routines library for sparse grids

Alin Muraraşu, Gerrit Buse, Dirk Pflüger, Josef Weidendorfer, Arndt Bode

Research output: Contribution to journalConference articlepeer-review

14 Scopus citations

Abstract

In a complex processor landscape dominated by multi- and many-core processors, simplifying programming plays a crucial role in enhancing developers' productivity. One way is to use highly tuned library functions. In this paper we present fastsg, an optimized library for the sparse grid technique with support for dimensional truncation. With optimizations for best cache use and vectorization, we improve the performance on one processor core up to a factor of 10. Parallelization using OpenMP scales almost linearly on a 12-core system.

Original languageEnglish
Pages (from-to)354-363
Number of pages10
JournalProcedia Computer Science
Volume9
DOIs
StatePublished - 2012
Event12th Annual International Conference on Computational Science, ICCS 2012 - Omaha, NB, United States
Duration: 4 Jun 20126 Jun 2012

Keywords

  • Dimensional truncation
  • Library
  • Optimizations
  • Sparse grids

Fingerprint

Dive into the research topics of 'Fastsg: A fast routines library for sparse grids'. Together they form a unique fingerprint.

Cite this