Related papers: Parallel TreeSPH: A Tool for Galaxy Formation
Treemaps have been widely applied to the visualization of hierarchical data. A treemap takes a weighted tree and visualizes its leaves in a nested planar geometric shape, with sub-regions partitioned such that each sub-region has an area…
The wavelet tree has become a very useful data structure to efficiently represent and query large volumes of data in many different domains, from bioinformatics to geographic information systems. One problem with wavelet trees is their…
\susy23 is a Monte-Carlo package for generating supersymmetric (SUSY) processes at $e^+e^-$ colliders. Twenty-three types of SUSY processes with 2 or 3 final state particles at tree level are included in version 2.0. {\susy23} addresses…
Understanding how galaxy populations emerge and evolve from the growth of dark matter structure is a central challenge in galaxy formation theory. Semi-analytic models (SAMs) provide an efficient framework to address this problem, but…
We present a novel implementation of supermassive black hole (SMBH) formation, dynamics, and accretion in the massively parallel tree+SPH code, ChaNGa. This approach improves the modeling of SMBHs in fully cosmological simulations, allowing…
Graph search and sparse data-structure traversal workloads contain challenging irregular memory patterns on global data structures that need to be modified atomically. Distributed processing of these workloads has relied on server threads…
A number of novel programming languages and libraries have been proposed that offer simpler-to-use models of concurrency than threads. It is challenging, however, to devise execution models that successfully realise their abstractions…
Semi-analytic models (SAMs) have been treating galaxy populations as dynamical systems for $\gtrsim50$ years, but their evolution equations remain poorly constrained. We introduce sapphire, a modular, automatically differentiable,…
[abridged] We present results from the latest version of the GAEA theoretical model of galaxy formation coupled with merger trees extracted from the Planck Millennium Simulation (PMS). With respect to the Millennium Simulation, the PMS…
We introduce PHEW (Parallel HiErarchical Watershed), a new segmentation algorithm to detect structures in astrophysical fluid simulations, and its implementation into the adaptive mesh refinement (AMR) code ramses. PHEW works on the density…
We present the pseudo-particle multipole method (P2M2), a new method to handle multipole expansion in fast multipole method and treecode. This method uses a small number of pseudo-particles to express multipole expansion. With this method,…
Merger trees follow the growth and merger of dark-matter haloes over cosmic history. As well as giving important insights into the growth of cosmic structure in their own right, they provide an essential backbone to semi-analytic models of…
Modeling of collisionless galactic systems is based on the N-body model, which requires large computational resources due to the long-range nature of gravitational forces. The most common method for calculating gravity is the TreeCode…
This paper investigates the execution of tree-shaped task graphs using multiple processors. Each edge of such a tree represents some large data. A task can only be executed if all input and output data fit into memory, and a data can only…
We compare different methods for sampling from discrete probability distributions and introduce a new algorithm which is especially efficient on massively parallel processors, such as GPUs. The scheme preserves the distribution properties…
This paper presents an efficient method to perform Structured Matrix Approximation by Separation and Hierarchy (SMASH), when the original dense matrix is associated with a kernel function. Given points in a domain, a tree structure is first…
A recent work shows how we can optimize a tree based mode of operation for a rate 1 hash function. In particular, an algorithm and a theorem are presented for selecting a good tree topology in order to optimize both the running time and the…
The growing volume of data in scientific domains has made spatial query processing increasingly challenging due to high data transfer costs across the memory hierarchy and limited memory bandwidth. To address these bottlenecks and reduce…
The project, aimed at the theoretical support of experiments at modern and future accelerators -- TEVATRON, LHC, electron Linear Colliders (TESLA, NLC, CLIC) and muon factories, is presented. Within this project a four-level computer system…
Regional hydrology studies are often supported by high resolution simulations of subsurface flow that require expensive and extensive computations. Efficient usage of the latest high performance parallel computing systems becomes a…