Hybrid (CPU/GPU) Exact Nearest Neighbors Search in High-Dimensional Spaces - Artificial Intelligence Applications and Innovations Access content directly
Conference Papers Year : 2022

Hybrid (CPU/GPU) Exact Nearest Neighbors Search in High-Dimensional Spaces

Abstract

In this paper, we propose a hybrid algorithm for exact nearest neighbors queries in high-dimensional spaces. Indexing structures typically used for exact nearest neighbors search become less efficient in high-dimensional spaces, effectively requiring brute-force search. Our method uses a massively-parallel approach to brute-force search that efficiently splits the computational load between CPU and GPU. We show that the performance of our algorithm scales linearly with the dimensionality of the data, improving upon previous approaches for high-dimensional datasets. The algorithm is implemented in Julia, a high-level programming language for numerical and scientific computing. It is openly available at https://github.com/davnn/ParallelNeighbors.jl .
Embargoed file
Embargoed file
0 4 6
Year Month Jours
Avant la publication
Wednesday, January 1, 2025
Embargoed file
Wednesday, January 1, 2025
Please log in to request access to the document

Dates and versions

hal-04668665 , version 1 (07-08-2024)

Licence

Identifiers

Cite

David Muhr, Michael Affenzeller. Hybrid (CPU/GPU) Exact Nearest Neighbors Search in High-Dimensional Spaces. 18th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), Jun 2022, Hersonissos, Greece. pp.112-123, ⟨10.1007/978-3-031-08337-2_10⟩. ⟨hal-04668665⟩
0 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More