Related papers: Performance Optimisation of Smoothed Particle Hydr…
This paper proposes a novel GPU-based active nematic flow solver based on the smoothed particle hydrodynamics (SPH) method. Nematohydrodynamics equations are discretized using the SPH algorithm, and the periodic domain is enforced using the…
We describe and demonstrate a method for increasing the resolution locally in a Smoothed Particle Hydrodynamic (SPH) simulation, by splitting particles. We show that in simulations of self-gravitating collapse (of the sort which are…
Intel Xeon Phi many-integrated-core (MIC) architectures usher in a new era of terascale integration. Among emerging killer applications, parallel graph processing has been a critical technique to analyze connected data. In this paper, we…
This paper presents a generalised and efficient wall boundary treatment in the smoothed particle hydrodynamics (SPH) method for 3-D complex and arbitrary geometries with single- and multi-phase flows to be executed on graphics processing…
The well-known Smith-Waterman (SW) algorithm is the most commonly used method for local sequence alignments. However, SW is very computationally demanding for large protein databases. There exist several implementations that take advantage…
Energy consumption is increasingly becoming a limiting factor to the design of faster large-scale parallel systems, and development of energy-efficient and energy-aware applications is today a relevant issue for HPC code-developer…
This work discusses the performance of a modern numerical scheme for fluid dynamical problems on modern high-performance computing architectures. Our code implements a spatial nodal discontinuous Galerkin scheme that we test up to an order…
To optimize the geometry of airfoils for a specific application is an important engineering problem. In this context genetic algorithms have enjoyed some success as they are able to explore the search space without getting stuck in local…
Recently Graphics Processing Units (GPUs) have been used to speed up very CPU-intensive gravitational microlensing simulations. In this work, we use the Xeon Phi coprocessor to accelerate such simulations and compare its performance on a…
We present the methodology and performance of the new Lagrangian hydrodynamics code MAGMA2, a Smoothed Particle Hydrodynamics code that benefits from a number of non-standard enhancements. By default it uses high-order smoothing kernels and…
In this paper, we applied an improved Smoothing Particle Hydrodynamics (SPH) method by using gradient kernel renormalization in three-dimensional cases. The purpose of gradient kernel renormalization is to improve the accuracy of numerical…
Cloud-accessible quantum processors enable direct execution of quantum algorithms on heterogeneous hardware platforms. Unlike classical systems, however, identical quantum circuits may exhibit substantially different behavior across devices…
The use of reconfigurable computing, and FPGAs in particular, to accelerate computational kernels has the potential to be of great benefit to scientific codes and the HPC community in general. However, whilst recent advanced in FPGA tooling…
I present a review of Smoothed Particle Hydrodynamics (SPH), with the aim of providing a mathematically rigorous, clear derivation of the algorithms from first principles. The method of discretising a continuous field into particles using a…
Design considerations for molecular dynamics algorithms capable of taking advantage of the computational power of a graphics processing unit (GPU) are described. Accommodating the constraints of scalable streaming-multiprocessor hardware…
In two previous papers (Price & Monaghan 2004a,b) (papers I,II) we have described an algorithm for solving the equations of Magnetohydrodynamics (MHD) using the Smoothed Particle Hydrodynamics (SPH) method. The algorithm uses dissipative…
Graphics research on Smoothed Particle Hydrodynamics (SPH) has produced fantastic visual results that are unique across the board of research communities concerned with SPH simulations. Generally, the SPH formalism serves as a spatial…
Gadget3 is nowadays one of the most frequently used high performing parallel codes for cosmological hydrodynamical simulations. Recent analyses have shown t\ hat the Neighbour Search process of Gadget3 is one of the most time-consuming…
We describe a modified version of the NBODY6 code for simulating star clusters which greatly improves computational efficiency while sacrificing little in the way of accuracy. The distant force calculator is replaced by a GPU-enabled…
The Crossroads supercomputer was designed to simulate some of the most complex physical devices in the world. These simulations routinely require 1/2 petabyte or more of system memory running on thousands of compute nodes for months at a…