There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.conferencePlace | US | - |
dc.citation.conferencePlace | Philadelphia | - |
dc.citation.endPage | 122 | - |
dc.citation.startPage | 113 | - |
dc.citation.title | International Conference on Parallel Processing | - |
dc.contributor.author | Nam, Moohyeon | - |
dc.contributor.author | Kim, Jinwoong | - |
dc.contributor.author | Nam, Beomseok | - |
dc.date.accessioned | 2023-12-19T20:11:26Z | - |
dc.date.available | 2023-12-19T20:11:26Z | - |
dc.date.created | 2016-10-28 | - |
dc.date.issued | 2016-08-16 | - |
dc.description.abstract | The similarity search problem is found in many application domains including computer graphics, information retrieval, statistics, computational biology, and scientific data processing just to name a few. Recently several studies have been performed to accelerate the k-nearest neighbor (kNN) queries using GPUs, but most of the works develop brute-force exhaustive scanning algorithms leveraging a large number of GPU cores and none of the prior works employ GPUs for an n-ary tree structured index. It is known that multi-dimensional hierarchical indexing trees such as R-trees are inherently not well suited for GPUs because of their irregular tree traversal and memory access patterns. Traversing hierarchical tree structures in an irregular manner makes it difficult to exploit parallelism since GPUs are tailored for deterministic memory accesses. In this work, we develop a data parallel tree traversal algorithm, Parallel Scan and Backtrack (PSB), for kNN query processing on the GPU, this algorithm traverses a multi-dimensional tree structured index while avoiding warp divergence problems. In order to take advantage of accessing contiguous memory blocks, the proposed PSB algorithm performs linear scanning of sibling leaf nodes, which increases the chance to optimize the parallel SIMD algorithm. We evaluate the performance of the PSB algorithm against the classic branch-and-bound kNN query processing algorithm. Our experiments with real datasets show that the PSB algorithm is faster by a large margin than the branch-and-bound algorithm. | - |
dc.identifier.bibliographicCitation | International Conference on Parallel Processing, pp.113 - 122 | - |
dc.identifier.doi | 10.1109/ICPP.2016.20 | - |
dc.identifier.issn | 0190-3918 | - |
dc.identifier.scopusid | 2-s2.0-84990987745 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/32792 | - |
dc.identifier.url | http://ieeexplore.ieee.org/document/7573809/ | - |
dc.language | 영어 | - |
dc.publisher | IEEE | - |
dc.title | Parallel Tree Traversal for Nearest Neighbor Query on the GPU | - |
dc.type | Conference Paper | - |
dc.date.conferenceDate | 2016-08-16 | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.