Name
Abstract | ||
|---|---|---|
AbstractSearching 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. 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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1145/3412558 | ACM Transactions on Mathematical Software |
Keywords | DocType | Volume |
Bounding volume hierarchy, performance portable algorithm, geometric search | Journal | 47 |
Issue | ISSN | Citations |
1 | 0098-3500 | 1 |
PageRank | References | Authors |
0.35 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Damien Lebrun-Grandie | 1 | 4 | 0.77 |
| Andrey Prokopenko | 2 | 1 | 0.35 |
| Bruno Turcksin | 3 | 5 | 1.47 |
| Stuart R. Slattery | 4 | 2 | 1.04 |