返回
Parallel multi-dimensional range query processing with R-trees on GPU
DOI:10.1016/j.jpdc.2013.03.015.png)
摘要
En 中文
The general purpose computing on graphics processing unit (GP-GPU) has emerged as a new cost effective parallel computing paradigm in high performance computing research that enables large amount of data to be processed in parallel. Large scale scientific data intensive applications have been playing an important role in modern high performance computing research. A common access pattern into such scientific data analysis applications is multi-dimensional range query, but not much research has been conducted on multi-dimensional range query on the GPU. Inherently multi-dimensional indexing trees such as R-Trees are not well suited for GPU environment because of its irregular tree traversal. Traversing irregular tree search path makes it hard to maximize the utilization of massively parallel architectures. In this paper, we propose a novel MPTS (Massively Parallel Three-phase Scanning) R-tree traversal algorithm for multi-dimensional range query, that converts recursive access to tree nodes into sequential access. Our extensive experimental study shows that MPTS R-tree traversal algorithm on NVIDIA Tesla M2090 GPU consistently outperforms traditional recursive R-trees search algorithm on Intel Xeon E5506 processors. (C) 2013 Elsevier Inc. All rights reserved.
Keyword:
CUDA
GPGPU
GPU
Parallel indexing
Parallel multi-dimensional indexing
Parallel R-tree
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
Enhancement of group III atom interdiffusion by nondopant oxygen implants in In0.53Ga0.47As-In0.52Al0.48As multiquantum wells通过非掺杂氧注入增强In₀.₅₃Ga₀.₄₇As-In₀.₅₂Al₀.₄₈As多量子阱中III族原子的互扩散

