Understand
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}.
Reading the bibliography…