Related papers: A Parallel Monte Carlo Code for Simulating Collisi…

We present the Monte Carlo integration code MoCaNLO, which computes cross sections and distributions for processes at high-energy colliders like the LHC at leading and next-to-leading order (NLO) in the strong and electroweak couplings. It…

We introduce a new high-performance design for parallelism within the Quantum Monte Carlo code QMCPACK. We demonstrate that the new design is better able to exploit the hierarchical parallelism of heterogeneous architectures compared to the…

I describe here the performance 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 scheme for the parallelization of quantum Monte Carlo on graphical processing units, focusing on bosonic systems and variational Monte Carlo. We use asynchronous execution schemes with shared memory persistence, and obtain an…

This paper investigates the parallel complexity of several non-equilibrium growth models. Invasion percolation, Eden growth, ballistic deposition and solid-on-solid growth are all seemingly highly sequential processes that yield…

We summarize a series of numerical experiments of collisional dynamics in dense stellar systems such as globular clusters (GCs) and in weakly collisional plasmas using a novel simulation technique, the so-called Multi-particle collision…

We have developed a gravity solver based on combining the well developed Particle-Mesh (PM) method and TREE methods. It is designed for and has been implemented on parallel computer architectures. The new code can deal with tens of millions…

In this paper, we present our conclusions from the numerical study of the collapse of a destabilized collisionless stellar system. We use both direct integration of the Vlasov-Poisson equations and an N-body tree code to obtain our results,…

We present a new efficient method for Monte Carlo simulations of diffusion-reaction processes. First introduced by us in [Phys. Rev. Lett., 97:230602, 2006], the new algorithm skips the traditional small diffusion hops and propagates the…

We present an algorithm for quickly generating multiple realizations of N-body simulations to be used, for example, for cosmological parameter estimation from surveys of large-scale structure. Our algorithm uses a new method to resample the…

We have developed a parallel Particle-Particle, Particle-Mesh (P3M) simulation code for the Cray T3E parallel supercomputer that is well suited to studying the time evolution of systems of particles interacting via gravity and gas forces in…

Merging galaxy clusters have become one of the most important probes of dark matter, providing evidence for dark matter over modified gravity and even constraints on the dark matter self-interaction cross-section. To properly constrain the…

For simulations that deal only with dark matter or stellar systems, the conventional N-body technique is fast, memory efficient, and relatively simple to implement. However when including the effects of gas physics, mesh codes are at a…

We review the recent optimizations of gravitational $N$-body kernels for running them on graphics processing units (GPUs), on single hosts and massive parallel platforms. For each of the two main $N$-body techniques, direct summation and…

We revisit a method to incorporate the Vainshtein screening mechanism in N-body simulations proposed by R. Scoccimarro in~\cite{Scoccimarro:2009eu}. We further extend this method to cover a subset of Horndeski theories that evade the bound…

We design and implement HPMC, a scalable hard particle Monte Carlo simulation toolkit, and release it open source as part of HOOMD-blue. HPMC runs in parallel on many CPUs and many GPUs using domain decomposition. We employ BVH trees…

We introduce a GPU-accelerated hybrid hydro/N-body code (Enzo-N) designed to address the challenges of concurrently simulating star clusters and their parent galaxies. This task has been exceedingly challenging, primarily due to the…

Based on the worm algorithm in the path-integral representation, we propose a general quantum Monte Carlo algorithm suitable for parallelizing on a distributed-memory computer by domain decomposition. Of particular importance is its…

We report on the results of a direct N-body simulation of a star cluster that started with N = 200 000, comprising 195 000 single stars and 5 000 primordial binaries. The code used for the simulation includes stellar evolution, binary…

We formulate and test a hybrid fluid-Monte Carlo scheme for the treatment of elastic collisions in gases and plasmas. While our primary focus and demonstrations of applicability are for moderately collisional plasmas, as described by the…