7 citations · 11 across the 5 of their papers we have counts for
7 papers
Cosmological Hydrodynamics at Exascale: A Trillion-Particle Leap in Capability
Nicholas Frontiere, J. D. Emberson, Michael Buehlmann +10
Resolving the most fundamental questions in cosmology requires simulations that match the scale, fidelity, and physical complexity demanded by next-generation sky surveys. To achie…
The ArborX library: version 2.0
Andrey Prokopenko, Daniel Arndt, Damien Lebrun-Grandié +1
This paper provides an overview of the 2.0 release of the ArborX library, a performance portable geometric search library based on Kokkos. We describe the major changes in ArborX 2…
Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
Andrey Prokopenko, Damien Lebrun-Grandié
Stackless traversal is a technique to speed up range queries by avoiding usage of a stack during the tree traversal. One way to achieve that is to transform a given binary tree to…
PANDORA: A Parallel Dendrogram Construction Algorithm for Single Linkage Clustering on GPU
Piyush Sao, Andrey Prokopenko, Damien Lebrun-Grandié
This paper presents \pandora, a novel parallel algorithm for efficiently constructing dendrograms for single-linkage hierarchical clustering, including \hdbscan. Traditional dendro…
A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs
Andrey Prokopenko, Piyush Sao, Damien Lebrun-Grandié
Computing the Euclidean minimum spanning tree (EMST) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing…
Fast tree-based algorithms for DBSCAN for low-dimensional data on GPUs
Andrey Prokopenko, Damien Lebrun-Grandie, Daniel Arndt
DBSCAN is a well-known density-based clustering algorithm to discover arbitrary shape clusters. While conceptually simple in serial, the algorithm is challenging to efficiently par…