Multicore Implementation of K-Means Clustering Algorithm

Rishabh Saklani, Karan Purohit, Satvik Vats, Vikrant Sharma, V. Kukreja, S. Yadav
{"title":"Multicore Implementation of K-Means Clustering Algorithm","authors":"Rishabh Saklani, Karan Purohit, Satvik Vats, Vikrant Sharma, V. Kukreja, S. Yadav","doi":"10.1109/ICAAIC56838.2023.10140800","DOIUrl":null,"url":null,"abstract":"Multi-core processing is extensively used in every sector for its performance efficiency, with the advent of multi-core architecture have to modify the existing primitive algorithms. This study analyses the feasibility of K-mean data-mining technique, which is applied to a hybrid cluster with multi-core programming. The algorithm is developed using Message Passing Interface (MPI) and C programming languages for the parallel processing of the sets and uses the CPU to its maximum power for the hybrid sets. The heterogeneous clusters are confirmed by the usage of MPICH2 (High performance and portability implementation of MPI). examined the algorithm for the huge dataset. The dataset is split into a number of cores and each of the cores estimates the number of dusters on the same dataset interdependent to each other. By this, assert the core processor time for communication is significant for huge datasets. Hence, the same dataset for two different processors takes different times even with identical speed and memory and also with different speeds and access times.","PeriodicalId":267906,"journal":{"name":"2023 2nd International Conference on Applied Artificial Intelligence and Computing (ICAAIC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 2nd International Conference on Applied Artificial Intelligence and Computing (ICAAIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAAIC56838.2023.10140800","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Multi-core processing is extensively used in every sector for its performance efficiency, with the advent of multi-core architecture have to modify the existing primitive algorithms. This study analyses the feasibility of K-mean data-mining technique, which is applied to a hybrid cluster with multi-core programming. The algorithm is developed using Message Passing Interface (MPI) and C programming languages for the parallel processing of the sets and uses the CPU to its maximum power for the hybrid sets. The heterogeneous clusters are confirmed by the usage of MPICH2 (High performance and portability implementation of MPI). examined the algorithm for the huge dataset. The dataset is split into a number of cores and each of the cores estimates the number of dusters on the same dataset interdependent to each other. By this, assert the core processor time for communication is significant for huge datasets. Hence, the same dataset for two different processors takes different times even with identical speed and memory and also with different speeds and access times.
k -均值聚类算法的多核实现
多核处理以其优越的性能被广泛应用于各个领域,随着多核架构的出现,对现有的原语算法进行了修改。本文分析了k -均值数据挖掘技术应用于多核混合集群的可行性。该算法采用消息传递接口(Message Passing Interface, MPI)和C语言进行并行处理,并利用CPU最大功率处理混合集。异构集群通过MPICH2 (MPI的高性能和可移植性实现)的使用得到了证实。检查了庞大数据集的算法。数据集被分成许多核心,每个核心估计同一数据集上相互依赖的dusters的数量。由此可见,对于大型数据集来说,核心处理器的通信时间是非常重要的。因此,即使具有相同的速度和内存,并且具有不同的速度和访问时间,两个不同处理器的相同数据集也需要不同的时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信