Related papers: A Parallel Monte Carlo Code for Simulating Collisi…
The gravitational $N$-body problem is a nearly universal problem in astrophysics which, despite its deceptive simplicity, still presents a significant computational challenge. For collisional systems such as dense star clusters, the need to…
We describe a new implementation of a parallel N-body tree code. The code is load-balanced using the method of orthogonal recursive bisection to subdivide the N-body system into independent rectangular volumes each of which is mapped to a…
I describe here the performances of a parallel treecode with individual particle timesteps. The code is based on the Barnes-Hut algorithm and runs cosmological N-body simulations on parallel machines with a distributed memory architecture…
We present a novel, highly efficient algorithm to parallelize O(N^2) direct summation method for N-body problems with individual timesteps on distributed-memory parallel machines such as Beowulf clusters. Previously known algorithms, in…
A revision of Stod\{'o}{\l}kiewicz's Monte Carlo code is used to simulate evolution of large star clusters. A survey of the evolution of N-body systems influenced by the tidal field of a parent galaxy and by stellar evolution is presented.…
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…
Cosmological simulations of structures and galaxies formations have played a fundamental role in the study of the origin, formation and evolution of the Universe. These studies improved enormously with the use of supercomputers and parallel…
We have carried out N-body simulations for rotating star clusters with equal mass and compared the results with Fokker-Planck models. These two different approaches are found to produce fairly similar results, although there are some…
Computational chemistry allows researchers to experiment in sillico: by running a computer simulations of a biological or chemical processes of interest. Molecular dynamics with molecular mechanics model of interactions simulates N-body…
Current trends in parallel processors call for the design of efficient massively parallel algorithms for scientific computing. Parallel algorithms for Monte Carlo simulations of thermodynamic ensembles of particles have received little…
We present an algorithm for cluster dynamics to efficiently simulate large systems on MIMD parallel computers with large numbers of processors. The method divides physical space into rectangular cells which are assigned to processors and…
Particle-in-cell methods with stochastic collision models are commonly used to simulate collisional plasma dynamics, with applications ranging from hypersonic flight to semiconductor manufacturing. Code verification of such methods is…
Stellar collisions have long been envisioned to be of great importance in the center of galaxies where densities of 1e6 stars per cubic pc or higher are attained. Not only can they play a unique dynamical role by modifying stellar masses…
We experiment with a massively parallel implementation of an algorithm for simulating the dynamics of metastable decay in kinetic Ising models. The parallel scheme is directly applicable to a wide range of stochastic cellular automata where…
In a Keplerian system, a large number of bodies orbit a central mass. Accretion disks, protoplanetary disks, asteroid belts, and planetary rings are examples. Simulations of these systems require algorithms that are computationally…
This paper describes an N-body model for the dynamical evolution of the nearby globular cluster M4. The initial conditions, with N = 484710 particles, were generated from a published study of this cluster with a Monte Carlo code. With the…
We describe a new parallel N-body code for cosmological simulations. The code is based on a work- and data sharing scheme, and is implemented within the Cray Research Corporation's CRAFT programming environment. Different data distribution…
Cosmological large scale structure $N$-body simulations are computation-light, memory-heavy problems in supercomputing. The considerable amount of memory is usually dominated by an inefficient way of storing more than sufficient phase space…
We present a comparison between several simulation codes designed to study the core-collapse supernova mechanism. We pay close attention to controlling the initial conditions and input physics in order to ensure a meaningful and informative…
Direct gravitational simulations of n-body systems have a time complexity O(n^2), which gets computationally expensive as the number of bodies increases. Distributing this workload to multiple cores significantly speeds up the computation…