A cache-aware algorithm for PDES on hierarchical data structures based on space-filling curves

SIAM Journal on Scientific Computing

Volumn 28, Issue 5, 2006, Pages 1634-1650

  Günther, Frank ^a   Mehl, Miriam ^b   Pögl, Markus ^c   Zenger, Christoph ^b  

^a AUDI AG   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c ROHDE AND SCHWARZ GMBH AND CO KG   (Germany)

Author keywords

Cache awareness; Partial differential equations; Space filling curves; Space tree

Indexed keywords

DATA STRUCTURES; GRID COMPUTING; HIERARCHICAL SYSTEMS; PARTIAL DIFFERENTIAL EQUATIONS; PROBLEM SOLVING;

CACHE-AWARE ALGORITHM; CACHE-AWARENESS; SPACE-FILLING CURVES; SPACE-TREE;

ALGORITHMS;

EID: 34648834227     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/040604078     Document Type: Article

References (41)

1. M. J. AFTOSMIS, M. J. BERGER, AND G. ADOMAVIVIUS, A Parallel Multilevel Method for Adoptively Refined Cartesian Grids with Embedded Boundaries, AIAA Paper, 38th AIAA Aerospace Sciences Meeting and Exhibit, Reno, NV, 2000.
2. M. BADER, H.-J. BUNGARTZ, A. FRANK, AND R. MUNDANI, Space tree structures for pde solution, in Proceedings of ICCS 2002, Part 3, P. M. A. Sloot, C. J. K. Tan, J. J. Dongarra, and A. G. Hoekstra, eds., Lecture Notes in Comput. Sci. 2331, Springer, New York, 2002, pp. 662-671.
3. M. BADER AND C. ZENGER, Cache oblivious matrix multiplication using an element ordering based on the Peano curve, Linear Algebra Appl., (2006), to appear.
4. F. A. BORNEMANN, An adaptive multilevel approach to parabolic equations III: 2D error estimation and multilevel preconditioning, Impact Comput. Sci. Engrg., 4 (1992), pp. 1-45.
5. D. BRAESS, Finite Elements. Theory, Fast Solvers and Applications in Solid Mechanics, Cambridge University Press, Cambridge, UK, 2001.
6. E. D. DEMAINE, Cache-oblivious algorithms and data structures, in Lecture Notes from the EEF Summer School on Massive Data Sets, Lecture Notes in Computer Science, BRICS, University of Aarhus, Denmark, 2002.
7. S. CHATTERJEE AND S. SEN, Cache-efficient matrix transposition, in Proceedings of HPCA-6, Toulouse, France, 2000, IEEE Press, Piscataway, NJ, pp. 195-205.
8. S. CHATTERJEE, A. R. LEBECK, P. K. PATNALA, AND M. THOTTETHODI, Recursive array lay-outs and fast parallel matrix multiplication, in Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, Saint-Malo, France, 1999, ACM, New York, pp. 222-231.
9. W. CLARKE, Key-Based Parallel Adaptive Refinement for FEM, bachelor thesis, Department of Engineering, Australian National University, Canberra, Australia, 1996.
10. N. DIEMINGER, Kriterien für die Selbstadaption cache-effizienter Mehrgitteralgorithmen, diploma thesis, Institut für Informatik, TU München, Munich, Germany, 2005.
11. C. C. DOUGLAS, J. HU, M. KOWARSCHIK, U. RÜDE, AND C. WEISS, Cache optimization for structured and unstructured grid multigrid, Electron. Trans. Numer. Anal., 10 (2000), pp. 21-40.
12. M. FRIGO, C. E. LEIERSON, H. PROKOP, AND S. RAMCHANDRAN, Cache-oblivious algorithms, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science, New York, 1999, IEEE Press, Piscataway, NJ, pp. 285-297.
13. F. GÜNTHER, Eine cache-optimale Implementierung der Finite-Elemente-Methode, Doctoral thesis, TU München, Munich, Germany, 2004.
14. M. GRIEBEL, Multilevelverfahren als Iterationsmethoden über Erzeugendensystemen, Habilitationsschrift, TU München, Munich, Germany, 1993.
15. M. GRIEBEL AND G. W. ZUMBUSCH, Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves, Parallel Computing, 25 (1999), pp. 827-843.
16. M. GRIEBEL AND G. ZUMBUSCH, Hash based adaptive parallel multilevel methods with space-filling curves, in Proceedings of the NIC Symposium 2001, NIC Series 9, H. Rollnik and D. Wolf, eds., John von Neumann Institut für Computing, Forschungszentrum Jülich Germany, 2002, pp. 479-492.
17. J. HARTMANN, Entwicklung eines cache-optimalen Finite-Element-Verfahrens zur Lösung d-dimensionaler Probleme, diploma thesis, Institut für Informatik, TU München, Munich, Germany, 2005.
18. M. GRIEBEL AND G. ZUMBUSCH, Hash-storage techniques for adaptive multilevel solvers and their parallelization, in Domain Decomposition Methods 10 (Boulder, CO, 1997), Contemp. Math. 218, J. Mandel, C. Farha, and X.-C. Cai, eds., AMS, Providence, RI, 1998, pp. 271-278.
19. HP INVENT, perfmon: Create Powerful Performance Analysis Tools Which Use the IA-54 Performance Monitoring Unit (PMU), project website at http://www.hpl.hp.com/research/ linux/perfmon/index.php4.
20. M. KOWARSCHIK, Data Locality Optimizations for Iterative Numerical Algorithms and Cellular Automata on Hierarchical Memory Architectures, Ph.D. thesis, Institut für Informatik, Universität Erlangen-Nürnberg, SCS Publishing House, Ghent, Belgium, 2004.
21. M. KOWARSCHIK AND C. WEISS, An overview of cache optimization techniques and cache-aware numerical algorithms, in Algorithms for Memory Hierarchies-Advanced Lectures, Lecture Notes in Comput. Sci. 2625, U. Meyer, P. Sanders, and J. Sibeyn, eds., Springer, New York, Berlin, 2003, pp. 213-232.
22. A. KRAHNKE, Adaptive Verfahren höherer Ordnung auf cache-optimalen Datenstrukturen für dreidimensionale Probleme, Doctoral thesis, Institut für Informatik, TU München, Munich, Germany, 2005.
23. A. LASZLOFFY, J. LONG, AND A. K. PATRA, Simple data management, scheduling and solution strategies for managing the irregularities in parallel adaptive hp finite element simulations, Parallel Computing, 26 (13-14) (2000), pp. 1765-1788.
24. J. T. ODEN, A. PARA, AND Y. FENG, 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, Pennsylvania State University, Contemp. Math. 180, D. E. Keyes and J. Xu, eds., AMS, Providence, RI, 1994, pp. 203-214.
25. A. K. PATRA, J. LONG, AND A. LASZLOFFY, Efficient parallel adaptive finite element methods using self-scheduling data and computations, in HiPC: Proceedings of the 6th International Conference on High Performance Computing, Calcutta, India, P. Banerjee, V. K. Prasanna, and B. S. Sinha, eds., Lecture Notes in Comput. Sci. 1745, Springer, NY, 1999, pp. 359-363.
26. A. K. PATRA, A. LASZLOFFY, AND J. LONG, Data structures and load balancing for parallel adaptive hp finite-element methods, Comput. Math. Appl., 46 (2003), pp. 105-123.
27. M. PARASHAR AND J. C. BROWNE, On partitioning dynamic adaptive grid hierarchies, in Proceedings of the 29th Annual Hawaii International Conference on System Sciences, Maui, HI, 1996, pp. 604-613.
28. M. PARASHAR, J. C. BROWNE, C. EDWARDS, AND K. KLIMKOWSKI, A common data management infrastructure for parallel adaptive algorithms for PDE solutions, in Proceedings of the 1997 ACM/IEEE Conference on Supercomputing, ACM Press, New York, 1997, pp. 1-22.
29. B. PENTENRIEDER, Finite Element Solutions of Heat Conduction Problems in Complicated 3D Geometries Using the Multigrid Method, Diploma thesis, Fakultät für Informatik, TU München, Munich, Germany, 2005.
30. M. PÖGL, Entwicklung eines cache-optimalen 3D Finite-Element-Verfahrens für große Probleme, Doctoral thesis, Institut für Informatik, TU München, Munich, Germany, 2004.
31. H. PROKOP, Cache-Oblivious Algorithms, Master Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1999.
32. S. ROBERTS, S. KLYANASUNDARAM, M. CARDEW-HALL, AND W. CLARKE, A key based parallel adaptive refinement technique for finite element methods, in Proceedings of the Conference on Computational Techniques and Applications: CTAC '97, B. J. Noye, M. D. Teubner, and A. W. Gill, eds., World Scientific, Singapore, 1998, pp. 577-584.
33. H. SAGAN, Space-Filling Curves, Springer-Verlag, New York, 1994.
34. J. STEENSLAND, S. CHANDRA, AND M. PARASHAR, An application-centric characterization of domain-based SFC partitioners for parallel SAMR, IEEE Trans. Parallel Distributed Systems, 13 (2002), pp. 1275-1289.
35. R. J. STEVENS, A. F. LEHAR, AND F. H. PRESTON, Manipulation and presentation of multidimensional image data using the Peano scan, IEEE Trans. Pattern Anal. Machine Intell., PAMI-5 (1983), pp. 520-526.
36. O. TEMAM, Investigating optimal local memory performance, in Proceedings of the ACM International Conference on Architectural Support for Programming Languages and Operating Systems, San Diego, CA, 1998, ACM, New York, pp. 218-227.
37. L. VELHO AND J. DE MIRANDA GOMES, Digital halftoning with space-filling curves, Comput. Graphics, 25 (1991), pp. 81-90.
38. T. WEINZIERL, Eine cache-optimale Implementierung eines Navier-Stokes Lösers unter besonderer Berücksichtigung physikalischer Erhaltungssätze, diploma thesis, Institut für Informatik, TU München, Munich, Germany, 2005.
39. C. WEISS, Data Locality Optimizations for Multigrid Methods on Structured Grids, Ph.D. thesis, Institut für Informatik, TU München, Munich, Germany, 2001.
40. G. ZUMBUSCH, Adaptive Parallel Multilevel Methods for Partial Differential Equations, Habilitationsschrift, Mathematisch- Naturwissenschaftliche Fakultät, Universität Bonn, Bonn, Germany, 2001.
41. G. W. ZUMBUSCH, On the quality of space-filling curve induced partitions, Z. Angew. Math. Mech., 81 (suppl. 1) (2001), pp. 25-28.