...
首页> 外文期刊>Concurrency and computation: practice and experience >Reducing thread divergence in GPU-based bees swarmrnoptimization applied to association rule mining
【24h】

Reducing thread divergence in GPU-based bees swarmrnoptimization applied to association rule mining

机译:减少应用于关联规则挖掘的基于GPU的蜂群优化中的线程分歧

获取原文
获取原文并翻译 | 示例

摘要

The association rules mining (ARM) problem is one of the most important problems in the area of data mining.rnIt aims at finding all relevant association rules from transactional databases. It is CPU time intensivernand requires a huge computing power when dealing with large transactional databases. To deal with thisrnissue, Graphics Processing Units (GPUs) are a powerful tool to speed up the search process. However, theirrnperformance is closely subject to thread/branch divergence resulting from the single instruction multiplerndata parallel model of GPUs. In this paper, we propose three approaches based on database reorganization,rnaiming to reduce thread divergence in GPU-based bees swarm optimization metaheuristic for ARM, respectively,rnnamed block-based reordering, transactions-based reordering, and transactions-based reordering withrnmedian value. Theoretical and experimental studies have been carried out using well-known large ARMrninstances. The experiments have been performed on an Intel Xeon 64 bit quad-core processor E5520 coupledrnto Nvidia Tesla C2075 448 cores. The results show that the proposed approaches minimize considerably thernnumber of thread divergence and improve the overall execution time. Indeed, the number of thread divergencernoccurrences has been reduced by up to eight times making the execution much faster. Copyright ©rn2016 John Wiley & Sons, Ltd.
机译:关联规则挖掘(ARM)问题是数据挖掘领域中最重要的问题之一。它旨在从事务数据库中查找所有相关的关联规则。它占用大量的CPU时间,在处理大型事务数据库时需要巨大的计算能力。为了处理此问题,图形处理单元(GPU)是加快搜索过程的强大工具。但是,它们的性能很容易受到GPU的单指令多数据并行模型导致的线程/分支差异的影响。在本文中,我们提出了三种基于数据库重组的方法,分别是基于块的重新排序,基于事务的重新排序和基于中间值的基于事务的重新排序。已经使用众所周知的大型ARM实例进行了理论和实验研究。实验是在连接至Nvidia Tesla C2075 448内核的Intel Xeon 64位四核处理器E5520上进行的。结果表明,所提出的方法大大减少了线程发散的数量,并改善了整体执行时间。实际上,线程发散的次数已减少了多达八倍,从而使执行速度更快。版权所有©rn2016 John Wiley&Sons,Ltd.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号