Metraipolis › archive › dc_992fa9cce299

cosmokdtree: a flexible OpenMP-parallelized k-d tree for computational astrophysics applications — arXiv:2609.18316

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.18316
License (as archived): CC0-1.0
Archived: 2026-10-15T18:00:50.741Z
SHA-256 of the archived text: a2aa5b98d1d0ba8707290ae8fc4043937c46dcc646a051f2e23ec9fe5b94740b
Stable URL of this page: https://metraipolis.com/documento/dc_992fa9cce299

How to cite

cosmokdtree: a flexible OpenMP-parallelized k-d tree for computational astrophysics applications — arXiv:2609.18316 — arXiv (en), https://arxiv.org/abs/2609.18316 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_992fa9cce299 (Metraipolis archive dc_992fa9cce299, sha256 a2aa5b98d1d0ba8707290ae8fc4043937c46dcc646a051f2e23ec9fe5b94740b)

BibTeX

@misc{dc992fa9cce299,
  title = {cosmokdtree: a flexible OpenMP-parallelized k-d tree for computational astrophysics applications — arXiv:2609.18316},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.18316},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_992fa9cce299; sha256 a2aa5b98d1d0ba8707290ae8fc4043937c46dcc646a051f2e23ec9fe5b94740b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18316. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Modern numerical astrophysics applications present a common demand for efficient spatial querying techniques, such as neighbor searches or density estimations over billions of resolution elements. To address the growing need for fast and versatile tools tailored to these tasks, we present cosmokdtree, a fast and flexible multi-purpose k-d tree implementation in Fortran, parallelized with OpenMP directives. Our library supports arbitrary dimensionality and spatial distributions, and is designed for efficient tree construction and fast query performance for moderate-scale applications (performance tested up to 10^9 points). Python bindings coupled to the module are also provided. All these ingredients yield a k-d tree package suitable for analysis purposes. We benchmark cosmokdtree across a variety of scenarios, including different point distributions, dimensionality, and parallel scaling. We also compare its performance against the widely used scipy implementation and other efficient alternatives such as coretran's and a GPU-based version, showing that cosmokdtree consistently achieves lower construction and query times than CPU alternatives while keeping a reasonable memory usage. Our tree-building phase implementation, executed on a mid-range workstation-class CPU, approaches the performance of GPU-based implementations when run on high-end consumer graphic cards, although data-center GPUs, out of the scope for our comparison, could still deliver substantially higher performance and a broader conclusion cannot be extracted. We further present some applications tackling common problems in astrophysics, namely, the friends-of-friends clustering algorithm and the particle-to-mesh assignment process. The code is publicly released and intended to serve as a flexible multi-purpose tool for computational applications in a wide range of scenarios, particularly in astrophysics.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-17 in astro-ph.IM).
Categorie arXiv: Instrumentation and Methods for Astrophysics (astro-ph.IM).
Pagina del lavoro: https://arxiv.org/abs/2609.18316 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T17:12:54.856Z dalla pagina https://arxiv.org/catchup/astro-ph.IM/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).