ArborX: A Performance Portable Geometric Search Library

Lebrun-Grandie, Damien; Prokopenko, Andrey; Turcksin, Bruno; Slattery, Stuart R.

doi:10.1145/3412558

ArborX: A Performance Portable Geometric Search Library

Journal Article · Sun Dec 06 04:00:00 EST 2020 · ACM Transactions on Mathematical Software

DOI:https://doi.org/10.1145/3412558· OSTI ID:1735467

^[1]; ^[1]; ^[1]; ^[1]

Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

Searching for geometric objects that are close in space is a fundamental component of many applications. The performance of search algorithms comes to the forefront as the size of a problem increases both in terms of total object count as well as in the total number of search queries performed. Scientific applications requiring modern leadership-class supercomputers also pose an additional requirement of performance portability, i.e., being able to efficiently utilize a variety of hardware architectures. In this article, we introduce a new open-source C++ search library, ArborX, which we have designed for modern supercomputing architectures. Herein, we examine scalable search algorithms with a focus on performance, including a highly efficient parallel bounding volume hierarchy implementation, and propose a flexible interface making it easy to integrate with existing applications. We demonstrate the performance portability of ArborX on multi-core CPUs and GPUs and compare it to the state-of-the-art libraries such as Boost.Geometry.Index and nanoflann.

Research Organization:: Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)

Sponsoring Organization:: USDOE Office of Science (SC); USDOE National Nuclear Security Administration (NNSA)

Grant/Contract Number:: AC05-00OR22725

OSTI ID:: 1735467

Journal Information:: ACM Transactions on Mathematical Software, Journal Name: ACM Transactions on Mathematical Software Journal Issue: 1 Vol. 47; ISSN 0098-3500

Publisher:: Association for Computing MachineryCopyright Statement

Country of Publication:: United States

Language:: English

References (12)

LOF: identifying density-based local outliers Breunig, Markus M.; Kriegel, Hans-Peter; Ng, Raymond T. Proceedings of the 2000 ACM SIGMOD international conference on Management of data - SIGMOD '00 https://doi.org/10.1145/342009.335388	conference	January 2000
Comparison of nearest-neighbor-search strategies and implementations for efficient shape registration Elseberg, Jan; Magnenat, Stephane; Siegwart, Roland Universit� degli studi di Bergamo https://doi.org/10.6092/joser_2012_03_01_p2	text	January 2012
An augmented spatial digital tree algorithm for contact detection in computational mechanics Feng, Y. T.; Owen, D. R. J. International Journal for Numerical Methods in Engineering, Vol. 55, Issue 2 https://doi.org/10.1002/nme.502	journal	January 2002
Quantized bounding volume hierarchies for neighbor search in molecular simulations on graphics processing units Howard, Michael P.; Statt, Antonia; Madutsa, Felix Computational Materials Science, Vol. 164 https://doi.org/10.1016/j.commatsci.2019.04.004	journal	June 2019
Mesh-free data transfer algorithms for partitioned multiphysics problems: Conservation, accuracy, and parallelism Slattery, Stuart R. Journal of Computational Physics, Vol. 307 https://doi.org/10.1016/j.jcp.2015.11.055	journal	February 2016
Kokkos: Enabling manycore performance portability through polymorphic memory access patterns Carter Edwards, H.; Trott, Christian R.; Sunderland, Daniel Journal of Parallel and Distributed Computing, Vol. 74, Issue 12 https://doi.org/10.1016/j.jpdc.2014.07.003	journal	December 2014
A method for registration of 3-D shapes Besl, P. J.; McKay, Neil D. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 14, Issue 2 https://doi.org/10.1109/34.121791	journal	February 1992
Parallel BVH Construction Using Locally Density Clustering Hu, Yingsong; Wang, Weijian; Li, Dan IEEE Access, Vol. 7 https://doi.org/10.1109/ACCESS.2019.2932151	journal	January 2019
STR: a simple and efficient algorithm for R-tree packing Leutenegger, S. T.; Lopez, M. A.; Edgington, J. Proceedings 13th International Conference on Data Engineering https://doi.org/10.1109/ICDE.1997.582015	conference	January 1997
Compressed-leaf bounding volume hierarchies Benthin, Carsten; Wald, Ingo; Woop, Sven HPG '18: High-Performance Graphics, Proceedings of the Conference on High-Performance Graphics https://doi.org/10.1145/3231578.3231581	conference	August 2018
Multidimensional binary search trees used for associative searching Bentley, Jon Louis Communications of the ACM, Vol. 18, Issue 9 https://doi.org/10.1145/361002.361007	journal	September 1975
R-trees: a dynamic index structure for spatial searching Guttman, Antonin Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 https://doi.org/10.1145/602259.602266	conference	January 1984

Similar Records

ArborX 2.0

Software · Tue Apr 15 20:00:00 EDT 2025 · OSTI ID:code-154205

Advances in ArborX to support exascale applications

Journal Article · Thu Nov 07 23:00:00 EST 2024 · International Journal of High Performance Computing Applications · OSTI ID:2483951

The ArborX Library: Version 2.0

Journal Article · Thu Dec 11 19:00:00 EST 2025 · ACM Transactions on Mathematical Software · OSTI ID:3009445

Related Subjects

97 MATHEMATICS AND COMPUTING
bounding volume hierarchy
geometric search
performance portable algorithm

ArborX: A Performance Portable Geometric Search Library

Citation Formats

References (12)

Similar Records

Related Subjects