The ArborX library: version 2.0

2025-07-31

AI Summary

ArborX, a geometric search library, suffers from limited functionality and insufficient scalability for modern HPC workloads. Method: This work introduces a systematic enhancement framework: (1) a unified callback interface enabling user-defined result processing; (2) integration of brute-force search and distributed spatial partitioning data structures; and (3) extension of algorithmic support to novel applications including ray tracing and clustering. All implementations are built atop the Kokkos performance portability framework, ensuring seamless execution across CPU/GPU heterogeneous architectures and compatibility with CUDA, HIP, and other backends. Contribution/Results: The enhancements are incorporated into ArborX 2.0, significantly improving flexibility, application scope, and large-scale parallel efficiency. Benchmark evaluations on representative geometric query workloads demonstrate end-to-end performance gains and enhanced API usability, establishing ArborX as a more robust and versatile geometric search infrastructure for exascale computing.

Technology Category

• Search and Optimization: Distributed Search
• Knowledge Representation and Reasoning: Geometric, Spatial, and Temporal Reasoning
• Constraint Satisfaction and Optimization: Search

Application Category

• Graph Algorithms and Modeling for the Web: Querying, indexing, and retrieval in Web-related graphs
• Search and Retrieval-Augmented AI: Efficiency and scalability of Web search engines
• Systems and Infrastructure for Web, Mobile and WoT: Data management and stream processing for Web, mobile and wireless applications

Abstract

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.0 including a new interface for the library to support a wider range of user problems, new search data structures (brute force, distributed), support for user functions to be executed on the results (callbacks), and an expanded set of the supported algorithms (ray tracing, clustering).

Problem

• Enhances geometric search with performance portability
• Expands user problem support via new interface
• Adds search structures and algorithms like ray tracing

Innovation

• Performance portable geometric search library
• New interface supporting wider user problems
• Expanded algorithms like ray tracing