A cache-aware algorithm for PDEs on hierarchical data structures

Authors:
Frank Günther;Miriam Mehl;Markus Pögl;Christoph Zenger
Affiliations:
Institut für Informatik, TU München, Garching, Germany;Institut für Informatik, TU München, Garching, Germany;Institut für Informatik, TU München, Garching, Germany;Institut für Informatik, TU München, Garching, Germany
Venue:
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Year:
2004

Citing 7
Cited 0

Digital halftoning with space filling curves

Proceedings of the 18th annual conference on Computer graphics and interactive techniques
An adaptive multilevel approach to parabolic equations III: 2D error estimation and multilevel preconditioning

IMPACT of Computing in Science and Engineering
Recursive array layouts and fast parallel matrix multiplication

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves

Parallel Computing - Special issue on parallelization techniques for numerical modelling
Efficient Parallel Adaptive Finite Element Methods Using Self-Scheduling Data and Computations

HiPC '99 Proceedings of the 6th International Conference on High Performance Computing
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Manipulation and Presentation of Multidimensional Image Data Using the Peano Scan

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.