Cluster Optimization and Parallelization of Simulations with Dynamically Adaptive Grids
The present paper studies solvers for partial differential equations that work on dynamically adaptive grids stemming from spacetrees. Due to the underlying tree formalism, such grids efficiently can be decomposed into connected grid regions (clusters) on-the-fly. A graph on those clusters classified according to their grid invariancy, workload, multi-core affinity, and further meta data represents the inter-cluster communication. While stationary clusters already can be handled more efficiently than their dynamic counterparts, we propose to treat them as atomic grid entities and introduce a skip mechanism that allows the grid traversal to omit those regions completely. The communication graph ensures that the cluster data nevertheless are kept consistent, and several shared memory parallelization strategies are feasible. A hyperbolic benchmark that has to remesh selected mesh regions iteratively to preserve conforming tessellations acts as benchmark for the present work. We discuss runtime improvements resulting from the skip mechanism and the implications on shared memory performance and load balancing.
Keywordsdynamic adaptivity cluster skipping shared memory load balancing space-filling curve
Unable to display preview. Download preview PDF.
- 1.Bader, M., Böck, C., Schwaiger, J., Vigh, C.A.: Dynamically Adaptive Simulations with Minimal Memory Requirement - Solving the Shallow Water Equations Using Sierpinski Curves. SISC 32(1) (2010)Google Scholar
- 4.Borkar, S., Chien, A.A.: The future of microproc. Commun. ACM 54 (2011)Google Scholar
- 6.Burstedde, C., Wilcox, L.C., Ghattas, O.: p4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees. SISC (3) (2011)Google Scholar
- 13.March, W.B., et al.: Optimizing the comp. of n-point correlations on large-scale astronomical data. In: Proc. of the Int. Conf. on High Perf. Comp., Netw., Stor. and Analysis, SC 2012. IEEE Computer Society Press (2012)Google Scholar
- 14.Meister, O., Rahnema, K., Bader, M.: A Software Concept for Cache-Efficient Simulation on Dynamically Adaptive Structured Triangular Grids. In: De Boschhere, K., D’Hollander, E.H., Joubert, G.R., Padua, D., Peters, F. (eds.) Applications, Tools and Techniques on the Road to Exascale Computing. Advances in Parallel Computing, ParCo 2012, Gent, vol. 22, pp. 251–260. IOS Press (May 2012) ISSN: 0927-5452 Google Scholar
- 15.Rahimian, A., Lashuk, I., Veerapaneni, S., Chandramowlishwaran, A., Malhotra, D., Moon, L., Sampath, R., Shringarpure, A., Vetter, J., Vuduc, R., Zorin, D., Biros, G.: Petascale direct numerical simulation of blood flow on 200k cores and heterog. arch. In: Proc. of the 2010 ACM/IEEE Int. Conf. for HPC, Networking, Storage and Analysis, SC 2010, pp. 1–11. IEEE Computer Society (2010)Google Scholar
- 16.Rüde, U.: Mathematical and computational techniques for multilevel adaptive methods. Frontiers in Applied Mathematics, vol. 13. SIAM (1993)Google Scholar
- 18.Schreiber, M., Bungartz, H.-J., Bader, M.: Shared memory parallelization of fully-adaptive simulations using a dynamic tree-split and -join approach. In: IEEE Int. Conf. on High Performance Comp., HiPC (2012)Google Scholar
- 19.Schreiber, M., et al.: Generation of parameter-optimised algorithms for recursive mesh traversal algorithms (to be published, 2013)Google Scholar
- 20.Unterweger, K., Weinzierl, T., Ketcheson, D., Ahmadia, A.: Peanoclaw—a functionally-decomposed approach to adaptive mesh refinement with local time stepping for hyperb. conservation law solvers. Technical report, Technische Universität München (2013)Google Scholar
- 21.Weinzierl, T.: A Framework for Parallel PDE Solvers on Multiscale Adaptive Cartesian Grids. Verlag Dr. Hut (2009)Google Scholar