Towards Cache-Optimized Multigrid Using Patch-Adaptive Relaxation

Conference contribution


Publication Details

Author(s): Kowarschik M, Christadler I, Rüde U
Title edited volumes: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher: Springer-verlag
Publishing place: Berlin/Heidelberg
Publication year: 2006
Title of series: Lecture Notes in Computer Science
Volume: 3732
Conference Proceedings Title: PARA 2004 Proceedings
Pages range: 901--910
ISBN: 3-540-29067-2
ISSN: 0302-9743


Abstract

Most of today's computer architectures employ fast, yet relatively small cache memories in order to mitigate the effects of the constantly widening gap between CPU speed and main memory performance. Efficient execution of numerically intensive programs can only be expected if these hierarchical memory designs are respected. Our work targets the optimization of the cache performance of multigrid codes. The research efforts we will present in this paper first cover transformations that may be nutomized and then focus on fundamental algorithmic modifications which require careful mathematical analysis. We will present experimental results for the latter. © Springer-Verlag Berlin Heidelberg 2006.


FAU Authors / FAU Editors

Rüde, Ulrich Prof. Dr.
Lehrstuhl für Informatik 10 (Systemsimulation)


How to cite

APA:
Kowarschik, M., Christadler, I., & Rüde, U. (2006). Towards Cache-Optimized Multigrid Using Patch-Adaptive Relaxation. In PARA 2004 Proceedings (pp. 901--910). Kopenhagen: Berlin/Heidelberg: Springer-verlag.

MLA:
Kowarschik, Markus, Iris Christadler, and Ulrich Rüde. "Towards Cache-Optimized Multigrid Using Patch-Adaptive Relaxation." Proceedings of the PARA'04 WORKSHOP ON STATE-OF-THE-ART IN SCIENTIFIC COMPUTING, Kopenhagen Berlin/Heidelberg: Springer-verlag, 2006. 901--910.

BibTeX: 

Last updated on 2018-11-12 at 13:50