相关论文: Parallel TreeSPH: A Tool for Galaxy Formation
Galaxy mergers have been investigated for decades using smoothed particle hydrodynamics (SPH), but recent work highlighting inaccuracies inherent in the traditional SPH technique calls into question the reliability of previous studies. We…
A method of adapting smoothed particle hydrodynamics (SPH) with periodic boundary conditions for use with the special purpose device GRAPE is presented. GRAPE (GRAvity PipE) solves the Poisson and force equations for an N-body system by…
Generative models have the potential to transform the way we emulate Earth's changing climate. Previous generative approaches rely on weather-scale autoregression for climate emulation, but this is inherently slow for long climate horizons…
A large set of TREESPH simulations is used to test the global morphology of galaxy clusters and its evolution against X-ray data. A powerful method to investigate substructures in galaxy clusters are the power ratios introduced by Buote &…
Cosmological N-body simulations rank among the most computationally intensive efforts today. A key challenge is the analysis of structure, substructure, and the merger history for many billions of compact particle clusters, called halos.…
SHAP (SHapley Additive exPlanation) values provide a game theoretic interpretation of the predictions of machine learning models based on Shapley values. While exact calculation of SHAP values is computationally intractable in general, a…
We have incorporated star formation algorithms into a hybrid N-body/smoothed particle hydrodynamics code (TREESPH) in order to describe the star forming properties of disk galaxies over timescales of a few billion years. The models employ a…
We present a computational algorithm for computing short range forces between particles. The algorithm has two distinguishing features. First, it is optimized for multi-processor computers, and will use as many processors as are available.…
Simulations of galaxy formation follow the gravitational and hydrodynamical interactions between gas, stars and dark matter through cosmic time. The huge dynamic range of such calculations severely limits strong scaling behaviour of the…
We present a Fortran 95 code for simulating the evolution of astrophysical systems using particles to represent the underlying fluid flow. The code is designed to be versatile, flexible and extensible, with modular options that can be…
Speculative decoding is a technique to leverage hardware concurrency in order to enable multiple steps of token generation in a single forward pass, thus improving the efficiency of large-scale autoregressive (AR) Transformer models.…
We have developed Remote-GRAPE, a subroutine library to use the special purpose computer GRAPE-3A. The GRAPE-3A can efficiently calculate gravitational force between particles, and construct neighbor lists. All other calculations are…
We introduce several parallel algorithms operating on a distributed forest of adaptive quadtrees/octrees. They are targeted at large-scale applications relying on data layouts that are more complex than required for standard finite…
N-body algorithms for long-range unscreened interactions like gravity belong to a class of highly irregular problems whose optimal solution is a challenging task for present-day massively parallel computers. In this paper we describe a…
FLY is a parallel treecode which makes heavy use of the one-sided communication paradigm to handle the management of the tree structure. In its public version the code implements the equations for cosmological evolution, and can be run for…
This paper describes a novel approach to neighbour-finding in Smoothed Particle Hydrodynamics (SPH) simulations with large dynamic range in smoothing length. This approach is based on hierarchical cell decompositions, sorted interactions,…
Recently, task-based programming models have emerged as a prominent alternative among shared-memory parallel programming paradigms. Inherently asynchronous, these models provide native support for dynamic load balancing and incorporate data…
We have invented a new algorithm to use with self-gravitating SPH Star Formation codes. The new method is designed to enable SPH simulations to self-regulate their numerical resolution, i.e. the number of SPH particles; the latter is…
We present the first hydrodynamical simulations of structure formation using the new moving mesh code AREPO and compare the results with GADGET simulations based on a traditional smoothed particle hydrodynamics (SPH) technique. The two…
Finding the exact close neighbors of each fluid element in mesh-free computational hydrodynamical methods, such as the Smoothed Particle Hydrodynamics (SPH), often becomes a main bottleneck for scaling their performance beyond a few million…