Parallelization of the Symplectic Massive Body Algorithm (SyMBA) N-body Code

نویسندگان

چکیده

Abstract Direct N -body simulations of a large number particles, especially in the study planetesimal dynamics and planet formation, have been computationally challenging even with modern machines. This work presents combination fully parallelized 2 /2 interactions incorporation GENGA code’s close encounter pair grouping strategy to enable MIMD parallelization Symplectic Massive Body Algorithm (SyMBA) OpenMP on multi-core CPUs shared-memory environment. SyMBAp (SyMBA parallelized) preserves symplectic nature SyMBA shows good scalability, speedup 30.8 times 56 cores simulation 5000 interactive particles.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vectorization and Parallelization of the Adaptive Mesh Refinement N -body Code

In this paper, we describe our vectorized and parallelized adaptive mesh refinement (AMR)N -body code with shared time steps, and report its performance on a Fujitsu VPP5000 vector-parallel supercomputer. Our AMR N -body code puts hierarchical meshes recursively where higher resolution is required and the time step of all particles are the same. The parts which are the most difficult to vectori...

متن کامل

Parallelization of the Treecode Algorithm for N-Body Simulation Using MPI, Hybrid, and GridRPC Programming Paradigms

This dissertation describes the parallelization of the treecode algorithm for N-Body problem and performance comparison among three different parallel programming paradigms, MPI, hybrid MPI-OpenMP, and GridRPC. In N-Body simulation, the specific routine for calculating the forces on the bodies which accounts for upwards of 90% of the cycles in typical computations is eminently suitable for obta...

متن کامل

Massive parallelization of the compact genetic algorithm

This paper presents an architecture which is suitable for a massive parallelization of the compact genetic algorithm. The resulting scheme has three major advantages. First, it has low synchronization costs. Second, it is fault tolerant, and third, it is scalable. The paper argues that the benefits that can be obtained with the proposed approach is potentially higher than those obtained with tr...

متن کامل

N-Body Code with Adaptive Mesh Refinement

We have developed a simulation code with the techniques which enhance both spatial and time resolution of the PM method for which the spatial resolution is restricted by the spacing of structured mesh. The adaptive mesh refinement (AMR) technique subdivides the cells which satisfy the refinement criterion recursively. The hierarchical meshes are maintained by the special data structure and are ...

متن کامل

N-body Code for Cosmological Simulations

We present a new high-resolution N -body algorithm for cosmological simulations. The algorithm employs a traditional particle-mesh technique on a cubic grid and successive multilevel relaxations on the finer meshes, introduced recursively in a fully adaptive manner in the regions where the density exceeds a predefined threshold. The mesh is generated to effectively match an arbitrary geometry o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Research notes of the AAS

سال: 2023

ISSN: ['2515-5172']

DOI: https://doi.org/10.3847/2515-5172/accc8a