Related papers: Efficient and Scalable Algorithms for Smoothed Par…
Splotch is a rendering algorithm for exploration and visual discovery in particle-based datasets coming from astronomical observations or numerical simulations. The strengths of the approach are production of high quality imagery and…
A combined N--body/SPH code is presented which benefits from the high speed of the special purpose hardware GRAPE (GRAvity PipE). Besides gravitational forces, GRAPE also returns the list of neighbours and can, therefore, be used to speed…
Powered by the simplicity of lock-free asynchrony, Hogwilld! is a go-to approach to parallelize SGD over a shared-memory setting. Despite its popularity and concomitant extensions, such as PASSM+ wherein concurrent processes update a shared…
Here we report the development of SPRAY, a massively parallel GPU accelerated, smoothed particle hydrodynamics (SPH)-based, radiation hydrodynamics (RHD) code designed specifically for simulating high intensity laser-plasma interactions.…
We present results based on an implementation of the Godunov Smoothed Particle Hydrodynamics (GSPH), originally developed by Inutsuka (2002), in the GADGET-3 hydrodynamic code. We first review the derivation of the GSPH discretization of…
We present a hydrodynamic simulation system using the GPU compute shaders of DirectX for simulating virtual agent behaviors and navigation inside a smoothed particle hydrodynamical (SPH) fluid environment with real-time water mesh surface…
We compare the statistical properties of galaxies found in two different models of hierarchical galaxy formation: the semi-analytic model of Cole et al. and the smoothed particle hydrodynamics (SPH) simulations of Pearce et al. Using a…
We propose a novel application of coded computing to the problem of the nearest neighbor estimation using MatDot Codes [Fahim. et.al. 2017], that are known to be optimal for matrix multiplication in terms of recovery threshold under storage…
This paper studies the hierarchical clustering problem, where the goal is to produce a dendrogram that represents clusters at varying scales of a data set. We propose the ParChain framework for designing parallel hierarchical agglomerative…
Contraction Hierarchies (CH) (Geisberger et al., 2008) is one of the most widely used algorithms for shortest-path queries on road networks. Compared to Dijkstra's algorithm, CH enables orders of magnitude faster query performance through a…
I describe a fast algorithm for the identification of connected sets of points where the point-wise connections are determined by a fixed spatial distance - a task commonly referred to in the cosmological simulation community as…
Previously, we have proposed a direct simulation scheme for colloidal dispersions in a Newtonian solvent [Phys.Rev.E 71,036707 (2005)]. An improved formulation called the ``Smoothed Profile (SP) method'' is presented here in which…
Quantum-based molecular dynamics (QMD) is a highly accurate and transferable method for material science simulations. However, the time scales and system sizes accessible to QMD are typically limited to picoseconds and a few hundred atoms.…
The smoothed particle hydrodynamics (SPH) method has been widely used to simulate incompressible and slightly compressible fluid flows. Adaptive refinement strategies to dynamically increase the resolution of the particles to capture sharp…
FISH is a fast and simple ideal magneto-hydrodynamics code that scales to ~10 000 processes for a Cartesian computational domain of ~1000^3 cells. The simplicity of FISH has been achieved by the rigorous application of the operator…
Cosmological N-body simulations are crucial for understanding how the Universe evolves. Studying large-scale distributions of matter in these simulations and comparing them to observations usually involves detecting dense clusters of…
Lagrangian particle methods based on detailed atomic and molecular models are powerful computational tools for studying the dynamics of microscale and nanoscale systems. However, the maximum time step is limited by the smallest oscillation…
I discuss the key features of Smoothed Particle Hydrodynamics (SPH) as a numerical method - in particular the key differences between SPH and more standard grid based approaches - that are important to the practitioner. These include the…
An efficient computational scheme devised for investigations of ground state properties of the electronically correlated systems is presented. As an example, $(H_{2})_{n}$ chain is considered with the long-range electron-electron…
We present the smoothed-particle hydrodynamics simulation code, Bonsai-SPH, which is a continuation of our previously developed gravity-only hierarchical $N$-body code (called Bonsai). The code is optimized for Graphics Processing Unit…