Abstract
Competitive numerical simulation codes solving partial differential equations have to tap the full potential of both modern numerical methods – like multi-grid and adaptive grid refinement – and available computing resources. In general, these two are rival tasks. Typically, hierarchical data structures resulting from multigrid and adaptive grid refinement impede efficient usage of modern memory architectures on the one hand and complicate the efficient parallelization on the other hand due to scattered data for coarse-level-points and unbalanced data trees. In our previous work, we managed to bring together high performance aspects in numerics as well as in hardware usage in a very satisfying way. The key to this success was to integrate space-filling curves consequently not only in the programs flow control but also in the construction of data structures which are processed linearly even for hierarchical multilevel data. In this paper, we present first results on the second challenge, namely the efficient parallelization of algorithms working on hierarchical data. It shows that with the same algorithms as desribed above, the two main demands on good parellel programs can be fulfilled in a natural way, too: The balanced data partitioning can be done quite easily and cheaply by cutting the queue of data linearized along the space-filling curve into equal pieces. Furtheron, this partitioning is quasi-optimal regarding the amount of communication. Thus, we will end up with a code that overcomes the quandary between hierarchical data and efficient memory usage and parallelization in a very natural way by a very deep integration of space-filling-curves in the underlying algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aftosmis, M.J., Berger, M.J., Adomavivius, G.: A Parallel Multilevel Method for adaptively Refined Cartesian Grids with Embedded Boundaries. AIAA Paper (2000)
Clarke, W.: Key-based parallel adaptive refinement for FEM, bachelor thesis, Australian National Univ., Dept. of Engineering (1996)
Griebel, M., Knapek, S., Zumbusch, G., Caglar, A.: Numerische Simulation in der Moleküldynamik. Numerik, Algorithmen. In: Parallelisierung, Anwendungen, Springer, Berlin (2004)
Griebel, M., Zumbusch, G.W.: Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves. Parallel Computing 25, 827–843 (1999)
Griebel, M., Zumbusch, G.: Hash based adaptive parallel multilevel methods with space-filling curves. In: Rollnik, H., Wolf, D. (eds.) NIC Symposium 2001, Germany. NIC Series, vol. 9, pp. 479–492. Forschungszentrum Jülich (2002) ISBN 3-00-009055-X
Günther, F., Mehl, M., Pögl, M., Zenger, C.: A Cache-Aware Algorithm for PDEs on hierarchical data structures based on space-filling curves. SIAM Journal on Scientific Computing, submitted
Günther, F.: Eine cache-optimale Implementierung der Finite-Elemente-Methode, Dissertation, TU München (2004)
Pögl, M.: Entwicklung eines ccheoptimalen 3D Finite-Element-Verfahrens für große Probleme, Dissertation, TU München (2004)
Roberts, S., Klyanasundaram, S., Cardew-Hall, M., Clarke, W.: A key based parallel adaptive refinement technique for finite element methods. In: Noye, B.J., Teubner, M.D., Gill, A.W. (eds.) Proc. Computational Techniques and Applications: CTAC 1997, pp. 577–584. World Scientific, Singapore (1998)
Sagan, H.: Space-Filling Curves. Springer, New York (1994)
Zumbusch, G.: Adaptive Parallel Multilevel Methods for Partial Differential Equations, Habilitationsschrift, Universität Bonn (2001)
Zumbusch, G.W.: On the quality of space-filling curve induced partitions. Z. Angew. Math. Mech. 81, 25–28 (2001), Suppl.1, also as report SFB 256, University Bonn 674 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Günther, F., Krahnke, A., Langlotz, M., Mehl, M., Pögl, M., Zenger, C. (2004). On the Parallelization of a Cache-Optimal Iterative Solver for PDEs Based on Hierarchical Data Structures and Space-Filling Curves. In: Kranzlmüller, D., Kacsuk, P., Dongarra, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2004. Lecture Notes in Computer Science, vol 3241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30218-6_58
Download citation
DOI: https://doi.org/10.1007/978-3-540-30218-6_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23163-9
Online ISBN: 978-3-540-30218-6
eBook Packages: Springer Book Archive