首页> 外文OA文献 >Map-reduce processing of K-means algorithm with FPGA-accelerated computer cluster
【2h】

Map-reduce processing of K-means algorithm with FPGA-accelerated computer cluster

机译:利用FpGa加速计算机集群对K-means算法进行map-reduce处理

摘要

The design and implementation of the k-means clustering algorithm on an FPGA-accelerated computer cluster is presented. The implementation followed the map-reduce programming model, with both the map and reduce functions executing autonomously to the CPU on multiple FPGAs. A hardware/software framework was developed to manage gateware execution on multiple FPGAs across the cluster. Using this k-means implementation as an example, system-level tradeoff study between computation and I/O performance in the target multi-FPGA execution environment was performed. When compared to a similar software implementation executing over the Hadoop MapReduce framework, 15.5× to 20.6× performance improvement has been achieved across a range of input data sets.
机译:提出了k-means聚类算法在FPGA加速计算机集群上的设计与实现。该实现遵循map-reduce编程模型,其中map和reduce函数均在多个FPGA上自动执行给CPU。开发了一种硬件/软件框架来管理整个集群中多个FPGA上的网关软件执行。以这种k-means实现为例,在目标多FPGA执行环境中进行了计算和I / O性能之间的系统级权衡研究。与在Hadoop MapReduce框架上执行的类似软件实现相比,跨各种输入数据集的性能提高了15.5倍至20.6倍。

著录项

  • 作者

    Choi YM; So HKH;

  • 作者单位
  • 年度 2014
  • 总页数
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号