Related papers: Performance Optimisation of Smoothed Particle Hydr…
Particle methods play an important role in the study of a wide variety of astrophysical fluid dynamics problems. The different methods currently in use are all variants of the so-called Smoothed Particle Hydrodynamics (SPH) scheme…
Smoothed Particle Hydrodynamics (SPH) is a unique numerical method widely used for astrophysical problems since it involves no spatial grid. Rather, fluid quantities are carried by a set of Lagrangian `particles' which move with the flow,…
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…
Molecular dynamics models materials by simulating each individual particle's trajectory. Many-body potentials lead to a more accurate trajectory simulation, and are used in materials science and computational chemistry. We present…
This work proposes a new GPU thread map for $m$-simplex domains, that scales its speedup with dimension and is energy efficient compared to other state of the art approaches. The main contributions of this work are i) the formulation of the…
Bloom filters are a fundamental data structure for approximate membership queries, with applications ranging from data analytics to databases and genomics. Several variants have been proposed to accommodate parallel architectures. GPUs,…
We present REMIX, a smoothed particle hydrodynamics (SPH) scheme designed to alleviate effects that typically suppress mixing and instability growth at density discontinuities in SPH simulations. We approach this problem by directly…
With the rapid development of DNN applications, multi-tenant execution, where multiple DNNs are co-located on a single SoC, is becoming a prevailing trend. Although many methods are proposed in prior works to improve multi-tenant…
This work presents a multi-layered methodology for efficiently accelerating multimodal foundation models (MFMs). It combines hardware and software co-design of transformer blocks with an optimization pipeline that reduces computational and…
In astrophysics numerical star cluster simulations and hydrodynamical methods like SPH require computational performance in the petaflop range. The GRAPE family of ASIC-based accelerators improves the cost-performance ratio compared to…
The paradigm shift towards multi-core and heterogeneous computing, driven by the fundamental power and thermal limits of single-core processors, has established energy efficiency as a first-class design constraint in high-performance…
We discuss capability of Smooth Particle Hydrodynamics to represent adequately the dynamics of self-gravitating systems, in particular for what regards the quality of approximation of force fields in the motion equations. When cubic spline…
We describe a set of lower-level abstractions to improve performance on modern large scale heterogeneous systems. These provide portable access to system- and hardware-dependent features, automatically apply dynamic optimizations at run…
We have found provably optimal algorithms for full-domain discrete-ordinate transport sweeps on a class of grids in 2D and 3D Cartesian geometry that are regular at a coarse level but arbitrary within the coarse blocks. We describe these…
We present and test a general-purpose code, called PPASPH, for evolving self-gravitating fluids in astrophysics, both with and without a collisionless component. In PPASPH, hydrodynamical properties are computed by using the SPH (Smoothed…
We review the current status of compact object simulations that are based on the Smooth Particle Hydrodynamics (SPH) method. The first main part of this review is dedicated to SPH as a numerical method. We begin by discussing relevant…
Direct numerical simulation of subsonic turbulence with smoothed particle hydrodynamics (SPH) has traditionally been hampered by zeroth-order (E0) errors, inaccurate gradient evaluations, and excessive numerical dissipation. We demonstrate…
A simple method for improving cache efficiency of serial and parallel explicit finite procedure with application to casting solidification simulation over three-dimensional complex geometries is presented. The method is based on division of…
Multicore architectures dominate today's processor market. Even though the number of cores and threads are pretty high and continues to grow, inherently serial algorithms do not benefit from the abundance of cores and threads. In this…
This paper introduces a novel approach to automatic ahead-of-time (AOT) parallelization and optimization of sequential Python programs for execution on distributed heterogeneous platforms. Our approach enables AOT source-to-source…