A Cache-Aware Algorithm for PDEs on Hierarchical Data Structures

13 years 9 months ago

Download www5.in.tum.de

A big challenge in implementing up to date simulation software for various applications is to bring together highly efﬁcient mathematical methods on the one hand side and an efﬁcient 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-efﬁciency and modern multilevel methods on adaptive grids. Our algorithm is based on stacks, the simplest possible and thus very cache-efﬁcient data structures.

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

Real-time Traffic

Applied Computing | Date Simulation Software | Efﬁcient Mathematical Methods | Modern Multilevel Methods | PARA 2004 |

claim paper

» GPU based sparse grid technique for solving multidimensional options pricing PDEs

» GramianBased Model Reduction for DataSparse Systems

» SHRINK a structural clustering algorithm for detecting hierarchical communities in network...

» Using Hierarchical Spatial Data Structures for Hierarchical Spatial Reasoning

» Sorting hierarchical data in external memory for archiving

» Tiresias Online Anomaly Detection for Hierarchical Operational Network Data

» A Divisive Hierarchical Structural Clustering Algorithm for Networks

» Simultaneous Registration and Segmentation of Anatomical Structures from Brain MRI

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	PARA
Authors	Frank Günther, Miriam Mehl, Markus Pögl, Christoph Zenger

Comments (0)

Sciweavers

A Cache-Aware Algorithm for PDEs on Hierarchical Data Structures

Applied Computing | Date Simulation Software | Efﬁcient Mathematical Methods | Modern Multilevel Methods | PARA 2004 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers