Rishabh Saklani, Karan Purohit, Satvik Vats, Vikrant Sharma, V. Kukreja, S. Yadav
{"title":"k -均值聚类算法的多核实现","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":"{\"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}","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}
Multicore Implementation of K-Means Clustering Algorithm
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.