{"title":"Optimizing MapReduce efficiency and reducing complexity with enhanced particle Swarm Optimization (MR-MPSO)","authors":"Chander Diwaker , Vijay Hasanpuri , Yonis Gulzar , Bhanu Sharma","doi":"10.1016/j.swevo.2025.101917","DOIUrl":null,"url":null,"abstract":"<div><div>Big data's explosive growth poses serious data management difficulties, especially given the data's unequal distribution across massive databases. Because of this mismatch, traditional software systems are less effective, which leads to complex and wasteful data processing. We provide MapReduce-Modified Particle Swarm Optimization (MR-MPSO), a unique optimization technique, to tackle this problem. This strategy not only improves the administration of enormous datasets but also tackles the complexity issue of data imbalance. The MR framework is used to handle large-scale data processing tasks, with MR-MPSO driving the map and reducing functions. Our technique combines adaptive inertia weight with Particle Swarm Optimization (PSO) to improve the accuracy and efficiency of optimization for 10 unimodal and multimodal benchmark functions. MR-MPSO outperforms four optimization algorithms—MR K-means, MR bat, MR whale, and regular MR-on measures such as fitness value mean, median, and standard deviation. Furthermore, MR-MPSO regularly enhances throughput and average I/O rate, especially in complex write operations, with gains ranging from 1.4 % to 28.9 % in throughput and 2.1 % to 17.7 % in I/O rate over typical MR approaches.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"95 ","pages":"Article 101917"},"PeriodicalIF":8.2000,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225000756","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Big data's explosive growth poses serious data management difficulties, especially given the data's unequal distribution across massive databases. Because of this mismatch, traditional software systems are less effective, which leads to complex and wasteful data processing. We provide MapReduce-Modified Particle Swarm Optimization (MR-MPSO), a unique optimization technique, to tackle this problem. This strategy not only improves the administration of enormous datasets but also tackles the complexity issue of data imbalance. The MR framework is used to handle large-scale data processing tasks, with MR-MPSO driving the map and reducing functions. Our technique combines adaptive inertia weight with Particle Swarm Optimization (PSO) to improve the accuracy and efficiency of optimization for 10 unimodal and multimodal benchmark functions. MR-MPSO outperforms four optimization algorithms—MR K-means, MR bat, MR whale, and regular MR-on measures such as fitness value mean, median, and standard deviation. Furthermore, MR-MPSO regularly enhances throughput and average I/O rate, especially in complex write operations, with gains ranging from 1.4 % to 28.9 % in throughput and 2.1 % to 17.7 % in I/O rate over typical MR approaches.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.