Douglas CC, Hu J, Iskandarani M, Kowarschik M, Rüde U, Weiß C (2000)
Publication Language: English
Publication Type: Conference contribution
Publication year: 2000
Publisher: Springer
Series: Lecture Notes in Physics
City/Town: Berlin
Pages Range: 124-137
Conference Proceedings Title: Numerical Treatment of Multiphase Flows in Porous Media. Proc. of the Int. Workshop held at Beijing, China, August 2--6, 1999
ISBN: 978-3-540-67566-2
URI: http://link.springer.com/chapter/10.1007/3-540-45467-5_10
Computers today rely heavily on good utilization of their cache memory subsystems. Compilers are optimized for business applications, not scientific computing ones, however. Automatic tiling of complex numerical algorithms for solving partial differential equations is simply not provided by compilers. Thus, absolutely terrible cache performance is a common result.
Multigrid algorithms combine several numerical algorithms into a more complicated algorithm. In this paper, an algorithm is derived that allows for data to pass through cache exactly once per multigrid level during a V cycle before the level changes. This is optimal cache usage for large problems that do not fit entirely in cache. The numerical techniques and algorithms discussed in this paper can be easily applied to numerical simulation of fluid flows in porous media.
APA:
Douglas, C.C., Hu, J., Iskandarani, M., Kowarschik, M., Rüde, U., & Weiß, C. (2000). Maximizing Cache Memory Usage for Multigrid Algorithms. In Numerical Treatment of Multiphase Flows in Porous Media. Proc. of the Int. Workshop held at Beijing, China, August 2--6, 1999 (pp. 124-137). Peking, CN: Berlin: Springer.
MLA:
Douglas, Craig C., et al. "Maximizing Cache Memory Usage for Multigrid Algorithms." Proceedings of the Int. Workshop on Numerical Treatment of Multiphase Flows in Porous Media, Peking Berlin: Springer, 2000. 124-137.
BibTeX: Download