Kowarschik M, Weiß C, Rüde U (2002)
Publication Type: Conference contribution
Publication year: 2002
Publisher: Springer-verlag
Edited Volumes: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Series: Lecture Notes in Computer Science
City/Town: Berlin
Book Volume: 2331
Pages Range: 642-651
Conference Proceedings Title: Proc. of the 2002 Int. Conf. on Computational Science (ICCS2002), Part III
Event location: Amsterdam
Efficient program execution can only be achieved if the codes respect the hierarchical memory design of the underlying architectures; programs must exploit caches to avoid high latencies involved with main memory accesses. However, iterative methods like multigrid are characterized by successive sweeps over data sets, which are commonly too large to fit in cache. This paper is based on our previous work on data access transformations for multigrid methods for constant coefficient problems. However, the case of variable coefficients, which we consider here, requires more complex data structures. We focus on data layout techniques to enhance the cache efficiency of multigrid codes for variable coefficient problems on regular meshes. We provide performance results which illustrate the effectiveness of our layout optimizations in conjunction with data access transformations. © Springer-Verlag 2002.
APA:
Kowarschik, M., Weiß, C., & Rüde, U. (2002). Data Layout Optimizations for Variable Coefficient Multigrid. In Proc. of the 2002 Int. Conf. on Computational Science (ICCS2002), Part III (pp. 642-651). Amsterdam: Berlin: Springer-verlag.
MLA:
Kowarschik, Markus, Christian Weiß, and Ulrich Rüde. "Data Layout Optimizations for Variable Coefficient Multigrid." Proceedings of the International Conference on Computational Science 2002 (ICCS 2002), Amsterdam Berlin: Springer-verlag, 2002. 642-651.
BibTeX: Download