首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Design Exploration of Geometric Biclustering for Microarray Data Analysis in Data Mining
【24h】

Design Exploration of Geometric Biclustering for Microarray Data Analysis in Data Mining

机译:数据挖掘中的微阵列数据分析几何图元化设计探索

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

摘要

Biclustering is an important technique in data mining for searching similar patterns. Geometric biclustering (GBC) method is used to reduce the complexity of the NP-complete biclustering algorithm. This paper studies three commonly used modern platforms including multi-core CPU, GPU and FPGA to accelerate this GBC algorithm. By analyzing the parallelizing property of the GBC algorithm, we design 1) a multi-threaded software running on a server grade multi-core CPU system, 2) a CUDA program for GPU to accelerate the GBC algorithm, and 3) a novel parameterizable and scalable hardware architecture implemented on an FPGA. Genes microarray pattern analysis is employed as an example to demonstrate performance comparisons on different platforms. In particular, we compare the speed and energy efficiency of the three proposed methods. We found that 1) GPU achieves the highest average speedup of 48 $times$ compared to single-threaded GBC program, 2) Our FPGA design can achieve higher speedup of 4$times$ for the computation for large microarray, and 3) FPGA consumes the least energy, which is about 3.53 $times$ more efficient than the single-threaded GBC program.
机译:双簇化是数据挖掘中搜索相似模式的一项重要技术。几何双簇(GBC)方法用于降低NP完全双簇算法的复杂性。本文研究了三个常用的现代平台,包括多核CPU,GPU和FPGA,以加速该GBC算法。通过分析GBC算法的并行化属性,我们设计1)在服务器级多核CPU系统上运行的多线程软件,2)GPU用来加速GBC算法的CUDA程序,以及3)新的可参数化和在FPGA上实现的可扩展硬件架构。以基因微阵列模式分析为例来说明在不同平台上的性能比较。特别是,我们比较了所提出的三种方法的速度和能效。我们发现1)与单线程GBC程序相比,GPU达到了48个 $ times $ 的最高平均速度,2)我们的FPGA设计可以为大型微阵列的计算实现4 $ times $ 的更高加速,并且3)FPGA消耗最少能量,大约比单线程GBC程序的效率高3.53 $ times $

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号