...
首页> 外文期刊>Data Science and Engineering >GPU-Based Dynamic Hyperspace Hash with Full Concurrency
【24h】

GPU-Based Dynamic Hyperspace Hash with Full Concurrency

机译:基于GPU的动态超空间哈希有完整并发

获取原文

摘要

Hyperspace 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.
机译:常用于NoSQL数据库的超空间散列通过将具有多个属性的对象映射到多维空间来构建索引。除了仅限主键外,它还可以加速处理某些辅助属性的查询。近年来,GPU的丰富计算资源为实现高性能超空间散列提供了机会。在这项研究中,我们为GPU构建了一个完全并发动态的斜坡哈希表。通过使用原子操作而不是锁定,我们使我们的方法非常平行和无锁。我们提出了一种特殊的并发控制策略,可确保无等待读取操作。我们的数据结构旨在考虑GPU特定的硬件特性。我们还提出了一个经线级预组合数据共享策略,以获得高并行加速。 NVIDIA RTX2080TI GPU的实验表明,GHSH比CPU对应于其对手执行大约20-100倍。具体而言,GHSH执行最多396次更新的更新,并处理最多995次查询/ s的搜索查询。与无法对非关键属性进行查询的其他GPU散系相比,GHSH表现出可比的建筑和检索性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号