2015 · 13 citations · 19 references
ComputingComputer ScienceHigh-performance ComputingAlgorithmsData MiningParallel ComputingData ParallelismGraphics Processing Unit ArchitectureGraphics Processing Unit ComputingGraphics Processing UnitsNearest Neighbor SearchSearching AlgorithmsExact AlgorithmsExact Nearest Neighbor SearchGpu Parallel AlgorithmsHeapsortIndex StructuresK-nearest Neighbor SearchMultimedia SearchSimilarity Search
In recent years, the use of Graphics Processing Units (GPUs) for data mining tasks has become popular. With modern processors integrating both CPUs and GPUs, it is also important to consider what tasks benefit from GPU processing and which do not, and apply a heterogeneous processing approach to improve the efficiency where applicable. Similarity search, also known as k-nearest neighbor search, is a key part of data mining applications and is used also extensively in applications such as multimedia search, where only a small subset of possible results are used. Our contribution is a new exact kNN algorithm with a compressed partial heapsort that outperforms other state-of-the-art exact kNN algorithms by leveraging both the GPU and CPU.
19
Piotr Indyk, Rajeev Motwani · 1998 · 4.2K citations · Full text
Basic Linear Algebra Subprograms for Fortran Usage
C. L. Lawson, Richard Hanson, David R. Kincaid et al. · ACM Transactions on Mathematical Software · 1979 · 1.6K citations · Full text
H. V. Jagadish, Beng Chin Ooi, Kian‐Lee Tan et al. · ACM Transactions on Database Systems · 2005 · 596 citations