The ART of Cosmological Simulations
| dc.creator | Gottloeber, Stefan | |
| dc.creator | Klypin, Anatoly | |
| dc.date | 2008-03-31 | |
| dc.date.accessioned | 2026-07-07T09:29:22Z | |
| dc.date.available | 2026-07-07T09:29:22Z | |
| dc.description | We describe the basic ideas of MPI parallelization of the N-body Adaptive Refinement Tree (ART) code. The code uses self-adaptive domain decomposition where boundaries of the domains (parallelepipeds) constantly move -- with many degrees of freedom -- in the search of the minimum of CPU time. The actual CPU time spent by each MPI task on previous time-step is used to adjust boundaries for the next time-step. For a typical decomposition of 5^3 domains, the number of possible changes in boundaries is 3^{84}. We describe two algorithms of finding minimum of CPU time for configurations with a large number of domains. Each MPI task in our code solves the N-body problem where the large-scale distribution of matter outside of the boundaries of a domain is represented by relatively few temporary large particles created by other domains. At the beginning of a zero-level time-step, domains create and exchange large particles. Then each domain advances all its particles for many small time-steps. At the end of the large step, the domains decide where to place new boundaries and re-distribute particles. The scheme requires little communications between processors and is very efficient for large cosmological simulations. | |
| dc.description | 15 pages, 5 figures, conference "High Performance Computing in Science and Engineering Garching/Munich 2007", Eds. S. Wagner et al, Springer, Berlin 2008 | |
| dc.identifier | https://arxiv.org/abs/0803.4343 | |
| dc.identifier | http://arxiv.org/abs/0803.4343 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/157763 | |
| dc.subject | Astrophysics | |
| dc.title | The ART of Cosmological Simulations | |
| dc.type | text |