GPU-Based Dynamic Hyperspace Hash with Full Concurrency
-
Published:2021-06-17
Issue:3
Volume:6
Page:265-279
-
ISSN:2364-1185
-
Container-title:Data Science and Engineering
-
language:en
-
Short-container-title:Data Sci. Eng.
Author:
Ren Zhuo,Gu Yu,Li Chuanwen,Li FangFang,Yu Ge
Abstract
AbstractHyperspace hashing which is often applied to NoSQL data-bases builds indexes by mapping objects with multiple attributes to a multidimensional space. It can accelerate processing queries of some secondary attributes in addition to just primary keys. In recent years, the rich computing resources of GPU provide opportunities for implementing high-performance HyperSpace Hash. In this study, we construct a fully concurrent dynamic hyperspace hash table for GPU. By using atomic operations instead of locking, we make our approach highly parallel and lock-free. We propose a special concurrency control strategy that ensures wait-free read operations. Our data structure is designed considering GPU specific hardware characteristics. We also propose a warp-level pre-combinations data sharing strategy to obtain high parallel acceleration. Experiments on an Nvidia RTX2080Ti GPU suggest that GHSH performs about 20-100X faster than its counterpart on CPU. Specifically, GHSH performs updates with up to 396 M updates/s and processes search queries with up to 995 M queries/s. Compared to other GPU hashes that cannot conduct queries on non-key attributes, GHSH demonstrates comparable building and retrieval performance.
Funder
the National Key R&D Program of China
the National Natural Science Foundation of China
the Fundamental Research Funds for the Central Universities
Liao Ning Revitalization Talents Program
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Computational Mechanics
Reference24 articles.
1. Escriva R, Wong B, Gün Sirer E (2012) Hyperdex: a distributed, searchable key-value store. In: PrACM SIGCOMM. ACM, pp 25–36
2. D’silva JV (2017) Roger Ruiz-Carrillo, and Cong Yu. Two rings to rule them all. In: DOLAP, Secondary indexing techniques for key-value stores
3. Pedro H, Matheus N, de Almeida Eduardo C (2018) Cracking kd-tree: the first multidimensional adaptive indexing (position paper). In: EDDY
4. Diegues N, Orazov M, Paiva J, Rodrigues L, Romano P (2014) Optimizing hyperspace hashing via analytical modelling and adaptation. ACM SIGAPP Appl Comput Rev 14(2):23–35
5. Guide Design (2013) Cuda c programming guide. In: NVIDIA
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献