基于遗传算法的调度算法与蚁群和人工蜂群优化技术的高效比较分析

Q4 Materials Science Solid State Technology Pub Date : 2020-02-29 DOI:10.37896/jxu14.4/120
K. Malathi, K. Priyadarsini
{"title":"基于遗传算法的调度算法与蚁群和人工蜂群优化技术的高效比较分析","authors":"K. Malathi, K. Priyadarsini","doi":"10.37896/jxu14.4/120","DOIUrl":null,"url":null,"abstract":"Day by Day so many Task scheduling algorithms are booming in the Cloud computing field. However they are having their own limitations. Now we are in the state to analyze all the algorithms and find out the better one for our efficient output. We know that Genetic Algorithm is one of the powerful metaheuristic Algorithms in task scheduling. But due to the random selection of parameters the process quality is not high. So we go for the combination of two or more optimization Algorithms counts on less execution time, maximum throughput, less makespan, full resource utilization, better quality of service, maximum energy consumption, Quick response time and less cost. In this paper we can analysis Genetic optimization hybrid ACO Algorithm, and genetic algorithm Hybrid with ABC Algorithm .Finally the analysis is tabulated for finding the better Algorithm.","PeriodicalId":21779,"journal":{"name":"Solid State Technology","volume":"1 1","pages":"525-531"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Efficient Comparison Analysis of Scheduling Algorithms with a base of Genetic algorithm to Optimization technique of Ant colony and Artificial Bee colony\",\"authors\":\"K. Malathi, K. Priyadarsini\",\"doi\":\"10.37896/jxu14.4/120\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Day by Day so many Task scheduling algorithms are booming in the Cloud computing field. However they are having their own limitations. Now we are in the state to analyze all the algorithms and find out the better one for our efficient output. We know that Genetic Algorithm is one of the powerful metaheuristic Algorithms in task scheduling. But due to the random selection of parameters the process quality is not high. So we go for the combination of two or more optimization Algorithms counts on less execution time, maximum throughput, less makespan, full resource utilization, better quality of service, maximum energy consumption, Quick response time and less cost. In this paper we can analysis Genetic optimization hybrid ACO Algorithm, and genetic algorithm Hybrid with ABC Algorithm .Finally the analysis is tabulated for finding the better Algorithm.\",\"PeriodicalId\":21779,\"journal\":{\"name\":\"Solid State Technology\",\"volume\":\"1 1\",\"pages\":\"525-531\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Solid State Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37896/jxu14.4/120\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Materials Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Solid State Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37896/jxu14.4/120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Materials Science","Score":null,"Total":0}
引用次数: 0

摘要

在云计算领域,越来越多的任务调度算法正在蓬勃发展。然而,它们也有自己的局限性。现在我们正处于分析所有算法的状态,并找出更好的算法来实现高效输出。我们知道,遗传算法是任务调度中一种强大的元启发式算法。但由于参数的随机选择,工艺质量不高。因此,我们选择两种或两种以上优化算法的组合,这取决于更少的执行时间、最大的吞吐量、更少的完工时间、充分的资源利用率、更好的服务质量、最大的能耗、快速的响应时间和更低的成本。本文对遗传优化混合ACO算法、遗传算法混合ABC算法进行了分析,最后将分析结果制成表格,找出更好的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Efficient Comparison Analysis of Scheduling Algorithms with a base of Genetic algorithm to Optimization technique of Ant colony and Artificial Bee colony
Day by Day so many Task scheduling algorithms are booming in the Cloud computing field. However they are having their own limitations. Now we are in the state to analyze all the algorithms and find out the better one for our efficient output. We know that Genetic Algorithm is one of the powerful metaheuristic Algorithms in task scheduling. But due to the random selection of parameters the process quality is not high. So we go for the combination of two or more optimization Algorithms counts on less execution time, maximum throughput, less makespan, full resource utilization, better quality of service, maximum energy consumption, Quick response time and less cost. In this paper we can analysis Genetic optimization hybrid ACO Algorithm, and genetic algorithm Hybrid with ABC Algorithm .Finally the analysis is tabulated for finding the better Algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Solid State Technology
Solid State Technology 工程技术-工程:电子与电气
CiteScore
0.30
自引率
0.00%
发文量
0
审稿时长
>12 weeks
期刊介绍: Information not localized
期刊最新文献
Dssc Performance of Zinc - Tin - Vanadium Oxide Nanocomposite Using Beetroot (Beta Vulgaris) as Dye Sensitizer On the Problem of Operation of Self-Propelled Drilling Rigs in the Harsh Winter Conditions of the Far North Design and analysis of alcohol gas sensors using nano particles for micro heaters Containerized Okra (Ladies' Fingers, Abelmoschus Esculentus): Organic Fertilizers Result For Growth Exploring The Lived Experiences Of Young Arnisadors: The Curricular and Co-Curricular Challenges
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1