A cache-aware algorithm for PDEs on hierarchical data structures

Frank Günther, Miriam Mehl, Markus Pögl, Christoph Zenger

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

A big challenge in implementing up to date simulation software for various applications is to bring together highly efficient mathematical methods on the one hand side and an efficient usage of modern computer archtitectures on the other hand. We concentrate on the solution of PDEs and demonstrate how to overcome the hereby occuring quandary between cache-efficiency and modern multilevel methods on adaptive grids. Our algorithm is based on stacks, the simplest possible and thus very cache-efficient data structures.

Original languageEnglish
Title of host publicationApplied Parallel Computing - State of the Art in Scientific Computing - 7th International Conference, PARA 2004, Revised Selected Papers
PublisherSpringer Verlag
Pages874-882
Number of pages9
ISBN (Print)3540290672, 9783540290674
DOIs
StatePublished - 2006
Event7th International Conference on Applied Parallel Computing, PARA 2004 - Lyngby, Denmark
Duration: 20 Jun 200423 Jun 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3732 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Conference on Applied Parallel Computing, PARA 2004
Country/TerritoryDenmark
CityLyngby
Period20/06/0423/06/04

Fingerprint

Dive into the research topics of 'A cache-aware algorithm for PDEs on hierarchical data structures'. Together they form a unique fingerprint.

Cite this