Fixed and Adaptive Cache Aware Algorithms for Multigrid Methods
Many current computer designs, including the node architecture of most parallel supercomputers, employ caches and a hierarchical memory structure. Hence, the speed of a multigrid code depends increasingly on how well the cache structure is exploited. Typical multigrid applications are running on data sets much too large to fit into any cache. Thus, applications should reuse copies of the data that is once brought into the cache as often as possible. In this paper, suitable fixed and adaptive blocking strategies for both structured and unstructured grids are introduced.
KeywordsMultigrid Method Unstructured Grid Cache Size Memory Hierarchy Black Node
Unable to display preview. Download preview PDF.
- 1.J. M. Anderson, L. M. Berc, J. Dean, S. Ghemawat, M.R. Henzinger, S. A. Leung, R. L. Sites, M. T. Vandevoorde, C. A. Waldspurger, and W. E. Weihl. Continuous profiling: Where have all the cycles gone? In Proceedings of the 16th ACM Symposium on Operating System Principles, pages 1–14, St. Malo, France, Oct. 1997.CrossRefGoogle Scholar
- 3.C. C. Douglas. Reusable cache memory object oriented multigrid algorithms. Preprint, 1999.Google Scholar
- 4.C. C. Douglas, J. Hu, M. Kowarschik, U. Rüde, and C. Weiß. Cache optimization for structured and unstructured grid multigrid. Electron. Trans. Numer. Anal., 9, 2000.Google Scholar
- 5.G. Karypis. METIS serial graph partitioning and matrix ordering software. In URL http://www-users.cs.umnedu/~karypis/metis/metis/main.shtml.
- 6.C. Weiß, W. Karl, M. Kowarschik, and U. Rüde. Memory characteristics of iterative methods. In Proceedings of the Supercomputing Conference, Portland, Oregon, Nov. 1999.Google Scholar