A cache-oblivious self-adaptive full multigrid method

Numerical Linear Algebra with Applications

Volumn 13, Issue 2-3, 2006, Pages 275-291

  Mehl, M ^a   Weinzierl, T ^a   Zenger, Chr ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Cache efficiency; Dynamical adaptivity; Multigrid; Space filling curve; Space tree

Indexed keywords

EID: 33645329332     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/nla.481     Document Type: Article

References (28)

1. Goedecker S, Hoisie A. Performance Optimization of Numerically Intensive Codes. SIAM: Philadelphia, PA, 2001.
2. Douglas CC. Caching in with multigrid algorithms: problems in two dimensions. Parallel Algorithms and Applications 1996; 9:195-204.
3. Douglas CC, Hu J, Kowarschik M, Rüde U, Weiß C. Cache optimization for structured and unstructured grid multigrid. Electronic Transactions on Numerical Analysis 2000; 10:21-40.
4. Kowarschik M. Data locality optimizations for iterative numerical algorithms and cellular automata on hierachical memory architectures. Ph.D. Thesis, Institut für Informatik, Universität Erlangen-Nürnberg, SCS Publishing House, 2004.
5. Kowarschik M, Weiß C. An overview of cache optimization techniques and cache-aware numerical algorithms. In Algorithms for Memory Hierarchies - Advanced Lectures, Meyer U, Sanders P, Sibeyen J (eds), Lecture Notes in Computer Science, vol. 2625. Springer: Berlin, 2003; 213-232.
6. Weiß C. Data locality optimizations for multigrid methods on structured grids. Ph.D Thesis. Institut für Informatik, TU München, 2001.
7. Sagan H. Space-Filling Curves. Springer: New York, 1994.
8. Prokop H. Cache-oblivious algorithms. Master Thesis, Massachusetts Institute of Technology, 1999.
9. Frigo M, Leierson CE, Prokop H, Ramchandran S. Cache-oblivious algorithms. Proceedings of the 40th Annual Symposium on Foundations of Computer Science, New York, 1999; 285-297.
10. Demaine ED. Cache-oblivious algorithms and data structures. Lecture Notes from the EEF Summer School on Massive Data Sets, University of Aarhus, Denmark, June 27-July 1, Lecture Notes in Computer Science. Springer: Berlin, 2002.
11. Griebel M, Zumbusch GW. Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves. Parallel Computing 1999; 25:827-843.
12. Griebel M, Zumbusch G. Hash based adaptive parallel multilevel methods with space-filling curves. In NIC Series, Rollnik H, Wolf D (eds), vol. 9. 2002; 479-492.
13. Oden JT, Patra A, Feng Y. Domain decomposition for adaptive hp finite element methods. In Domain Decomposition Methods in Scientific and Engineering Computing, Proceedings of the 7th International Conference on Domain Decomposition, Keyes D, Xu J (eds), Contemporary Mathematics, vol. 180. 1994; 203-214.
14. Patra AK, Long J, Laszloff A. Efficient parallel adaptive finite element methods using self-scheduling data and computations. In High Performance Computing - HiPC'99, 6th International Conference, Calcutta, India, December 17-20, 1999, Proceedings, Banerjee P, Prasarma VK, Sinha BP (eds), HiPC, Lecture Notes in Computer Science, vol. 1745. 1999; 359-363.
15. Roberts S, Klyanasundaram S, Cardew-Hall M, Clarke W. A key based parallel adaptive refinement technique for finite element methods. In Proceedings Computational Techniques and Applications: CTAC '97, Noye J, Teubner M, Gill A (eds) World Scientific: Singapore, 1998; 577-584.
16. Zumbusch GW. Adaptive Parallel Multilevel Methods for Partial Differential Equations. Universität Bonn: Habilitationsschrift, 2001.
17. Aftosmis MJ, Berger MJ, Adomavivius G. A parallel multilevel method for adaptively refined cartesian grids with embedded boundaries, American Institute of Aeronautics and Astronautics-2000-808, Aerospace Science Meeting and Exhibit, 38th, Reno, Nevada, January 10-13, 2000.
18. Braess D. Finite Elements. Theory, Fast Solvers and Applications in Solid Mechanics. Cambridge University Press: Cambridge, MA, 2001.
19. Günther F. Eine cache-optimale Implementierung der Finite-Elemente-Methode. Doctoral Thesis, Institut für Informatik, TU München, 2004.
20. Pögl M. Entwicklung eines Cache-optimalen 3D Finite-Element- Verfahrens für große Probleme. Doctoral Thesis, Institut für Informatik, TU München, 2004.
21. Hartmann J. Entwicklung eines cache-optimalen Finite-Element-Verfahrens zur Lösung d-dimensionaler Probleme. Diploma Thesis, Institut für Informatik, TU München, 2005.
22. Günther F, Mehl M, Pögl M, Zenger Ch. A cache-aware algorithm for PDEs on hierarchical data structures based on space-filling curves. SIAM Journal on Scientific Computing, under review.
23. Dieminger N. Kriterien für die Selbstadaption cache-effizienter Mehrgitteralgorithmen. Diploma Thesis, Institut für Informatik, TU München, 2005.
24. Fulton SR. On the accuracy of multigrid truncation error estimates. Electronic Transactions on Numerical Analysis 2003; 15:29-37.
25. Schneider S. Adaptive solution of elliptic partial differential equations by hierarchical tensor product finite elements. Doctoral Thesis, Institut für Informatik, TU München, 2000.
26. Kowarschik M, Weiß C. DiMEPACK - A cache-optimized multigrid library. In Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2001), Las Vegas, Nevada, U.S.A., Arabnia (ed.), vol. I, 2001.
27. Seward J, Nethercote N, Fitzhardinge J. Cachegrind: a cache-miss profiler, http://valgrind.kde.org/docs.html
28. Krahnke A. Adaptive Verfahren höherer Ordnung auf cache-optimalen Datenstrakturen für dreidimensionale Probleme. Doctoral Thesis, Institut für Informatik, TU München, 2005.