{"title":"基于性能感知模型的混合元搜索优化 map reduce 调度","authors":"Vishal Kumar, Sumit Kushwaha","doi":"10.1080/1206212X.2023.2277553","DOIUrl":null,"url":null,"abstract":"Because of the rapid rise in the count of corporations using cloud-dependent infrastructure as the foundation for big data storing and analysis. The fundamental difficulty in scheduling big data services in cloud-dependent systems is ensuring the shortest possible makespan while simultaneously reducing the number of resources being used. We have created a new, secure map reduce scheduling method that functions as follows. Initially, the cloud architecture is designed and the tasks are generated. In the pre-processing phase, the huge set of tasks was processed by the map-reduce scheduling framework. Afterward, the optimal task scheduling task is conducted which utilizes a hybrid algorithm named Tunicate Combined Moth Flame Algorithm (TCMFA), which provides better task scheduling via providing optimal makespan, execution time, and security. This proposed TCMFA is the hybridization of both Moth Flame Optimization (MFO) and Tunicate Swarm Algorithm (TSA). The error rate of the TCMFA gets reduced to 320 approximately over other conventional methods such as RSA, ACO, GHO, BTS, OWPSO, BES, PRO, SOA, COOT, TSA & MFO which proves the accuracy of our TCMFA and makes it more efficient and secure for optimal map-reduce scheduling.","PeriodicalId":39673,"journal":{"name":"International Journal of Computers and Applications","volume":"7 1","pages":"776 - 788"},"PeriodicalIF":0.0000,"publicationDate":"2023-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hybrid metaheuristic model based performance-aware optimization for map reduce scheduling\",\"authors\":\"Vishal Kumar, Sumit Kushwaha\",\"doi\":\"10.1080/1206212X.2023.2277553\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Because of the rapid rise in the count of corporations using cloud-dependent infrastructure as the foundation for big data storing and analysis. The fundamental difficulty in scheduling big data services in cloud-dependent systems is ensuring the shortest possible makespan while simultaneously reducing the number of resources being used. We have created a new, secure map reduce scheduling method that functions as follows. Initially, the cloud architecture is designed and the tasks are generated. In the pre-processing phase, the huge set of tasks was processed by the map-reduce scheduling framework. Afterward, the optimal task scheduling task is conducted which utilizes a hybrid algorithm named Tunicate Combined Moth Flame Algorithm (TCMFA), which provides better task scheduling via providing optimal makespan, execution time, and security. This proposed TCMFA is the hybridization of both Moth Flame Optimization (MFO) and Tunicate Swarm Algorithm (TSA). The error rate of the TCMFA gets reduced to 320 approximately over other conventional methods such as RSA, ACO, GHO, BTS, OWPSO, BES, PRO, SOA, COOT, TSA & MFO which proves the accuracy of our TCMFA and makes it more efficient and secure for optimal map-reduce scheduling.\",\"PeriodicalId\":39673,\"journal\":{\"name\":\"International Journal of Computers and Applications\",\"volume\":\"7 1\",\"pages\":\"776 - 788\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-11-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computers and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/1206212X.2023.2277553\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computers and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/1206212X.2023.2277553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Computer Science","Score":null,"Total":0}
Hybrid metaheuristic model based performance-aware optimization for map reduce scheduling
Because of the rapid rise in the count of corporations using cloud-dependent infrastructure as the foundation for big data storing and analysis. The fundamental difficulty in scheduling big data services in cloud-dependent systems is ensuring the shortest possible makespan while simultaneously reducing the number of resources being used. We have created a new, secure map reduce scheduling method that functions as follows. Initially, the cloud architecture is designed and the tasks are generated. In the pre-processing phase, the huge set of tasks was processed by the map-reduce scheduling framework. Afterward, the optimal task scheduling task is conducted which utilizes a hybrid algorithm named Tunicate Combined Moth Flame Algorithm (TCMFA), which provides better task scheduling via providing optimal makespan, execution time, and security. This proposed TCMFA is the hybridization of both Moth Flame Optimization (MFO) and Tunicate Swarm Algorithm (TSA). The error rate of the TCMFA gets reduced to 320 approximately over other conventional methods such as RSA, ACO, GHO, BTS, OWPSO, BES, PRO, SOA, COOT, TSA & MFO which proves the accuracy of our TCMFA and makes it more efficient and secure for optimal map-reduce scheduling.
期刊介绍:
The International Journal of Computers and Applications (IJCA) is a unique platform for publishing novel ideas, research outcomes and fundamental advances in all aspects of Computer Science, Computer Engineering, and Computer Applications. This is a peer-reviewed international journal with a vision to provide the academic and industrial community a platform for presenting original research ideas and applications. IJCA welcomes four special types of papers in addition to the regular research papers within its scope: (a) Papers for which all results could be easily reproducible. For such papers, the authors will be asked to upload "instructions for reproduction'''', possibly with the source codes or stable URLs (from where the codes could be downloaded). (b) Papers with negative results. For such papers, the experimental setting and negative results must be presented in detail. Also, why the negative results are important for the research community must be explained clearly. The rationale behind this kind of paper is that this would help researchers choose the correct approaches to solve problems and avoid the (already worked out) failed approaches. (c) Detailed report, case study and literature review articles about innovative software / hardware, new technology, high impact computer applications and future development with sufficient background and subject coverage. (d) Special issue papers focussing on a particular theme with significant importance or papers selected from a relevant conference with sufficient improvement and new material to differentiate from the papers published in a conference proceedings.