• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Asia-Pacific Software Engineering Conference >Software Optimizations of Multiple Sets Intersection via SIMD Instructions
【24h】

Software Optimizations of Multiple Sets Intersection via SIMD Instructions

机译：通过SIMD指令对多套路口进行软件优化

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Conjunctive Boolean query is one fundamental operation for document retrieval in many information systems and databases. In its most basic and popular form, a conjunctive query can be seen as the intersection problem of multiple sets of sorted integers. Various algorithms have been put up in terms of maximizing the query efficiency. In recent years, researchers began to exploit the parallel advantage of single-instruction-multiple-data (SIMD) instructions to accelerate the intersection procedure and achieved substantial gains over previous scalar algorithms. However, these works only focus on intersecting two sets at a time and ignore the scenario of multiple sets intersection. Missing from the literature is a thorough study that explores the combination of traditional multiple sets intersection algorithms and SIMD instructions. This article discusses software optimizations for the intersection algorithms via AVX2 and AVX512 SIMD instructions of modern processor architectures. Through an experimental analysis we show that the proposed is able to reduce comparisons executed while improving instruction throughput, thus gaining performance enhancement over previous methods.
机译：联合布尔查询是许多信息系统和数据库中用于文档检索的一项基本操作。在最基本和最流行的形式中，合取查询可以看作是多组排序整数的交集问题。为了最大化查询效率，提出了各种算法。近年来，研究人员开始利用单指令多数据（SIMD）指令的并行优势来加速相交过程，并比以前的标量算法获得了可观的收益。但是，这些作品仅专注于一次将两个集合相交，而忽略了多个集合相交的情况。文献中缺少一项全面的研究，该研究探索了传统的多集交集算法和SIMD指令的结合。本文讨论了通过现代处理器体系结构的AVX2和AVX512 SIMD指令对相交算法进行软件优化的方法。通过实验分析，我们表明所提出的方法能够减少执行的比较，同时提高指令吞吐量，从而比以前的方法获得更高的性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号