【24h】

Parallelization of K-medoid clustering algorithm

机译:K-medoid聚类算法的并行化

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

摘要

This paper presents an approach for paralleling K-medoid clustering algorithm. The K-medoid algorithm will be divided into tasks, which will be mapped into multiprocessor system. The control structure for the way of expressing the tasks in parallel form and the communication model that satisfied the mechanism for interaction between these tasks is presented. Data parallel model is built by decomposing the tasks among the processors. The implementation and testing of the parallel model have conducted using SESE academic simulator under Fedora 11 version at Linux OS environment.
机译:本文提出了一种并行的K-medoid聚类算法。 K-medoid算法将分为多个任务,这些任务将被映射到多处理器系统中。提出了并行表达任务的控制结构和满足这些任务交互机制的通信模型。通过分解处理器之间的任务来构建数据并行模型。并行模型的实现和测试是在Linux OS环境下使用Fedora 11版本的SESE学术模拟器进行的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号