EconPapers    
Economics at your fingertips  
 

The ART of Cosmological Simulations

Stefan Gottlöber () and Anatoly Klypin ()
Additional contact information
Stefan Gottlöber: Astrophysical Institute Potsdam
Anatoly Klypin: New Mexico State University, Astronomy Department

A chapter in High Performance Computing in Science and Engineering, Garching/Munich 2007, 2009, pp 29-43 from Springer

Abstract: Abstract 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 53 domains, the number of possible changes in boundaries is 384≈1040. 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.

Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-69182-2_3

Ordering information: This item can be ordered from
http://www.springer.com/9783540691822

DOI: 10.1007/978-3-540-69182-2_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2026-02-19
Handle: RePEc:spr:sprchp:978-3-540-69182-2_3