An Intelligent Task Scheduling Approach for Cloud Using IPSO and A* Search Algorithm

B. P. Kavin, S. Ganapathy, A. Kannan
{"title":"An Intelligent Task Scheduling Approach for Cloud Using IPSO and A* Search Algorithm","authors":"B. P. Kavin, S. Ganapathy, A. Kannan","doi":"10.1109/IC3.2018.8530545","DOIUrl":null,"url":null,"abstract":"Cloud computing technology is playing a vital role in this fast internet era for transferring, storing and accessing the large volume of confidential data which are official, medical and military. Efficient techniques for searching and processing the cloud data are essential for providing better service to the cloud users. For the fast processing and searching the data, many techniques were proposed by various researchers in the past. However, those techniques are not working in better results in cloud services. In a heterogeneous environment, achieving higher efficiency is an important issue in task scheduling. To solve this problem, many evolutionary algorithms have been adopted in the past. Even though it is a Nondeterministic Polynomial-hard problem, the local search algorithms are integrated for increasing convergence speed in population-based algorithms. In this paper, we propose a new task scheduling approach which combines an incremental particle swarm optimization and A * search algorithm for effective task scheduling. Moreover, the current particle swarm optimization algorithms and the heuristic algorithms gained in results on random and scientific Directed Acyclic Graph. The experiments show that the performance of the proposed approach is better when it is compared with the existing task scheduling approaches.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Eleventh International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2018.8530545","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Cloud computing technology is playing a vital role in this fast internet era for transferring, storing and accessing the large volume of confidential data which are official, medical and military. Efficient techniques for searching and processing the cloud data are essential for providing better service to the cloud users. For the fast processing and searching the data, many techniques were proposed by various researchers in the past. However, those techniques are not working in better results in cloud services. In a heterogeneous environment, achieving higher efficiency is an important issue in task scheduling. To solve this problem, many evolutionary algorithms have been adopted in the past. Even though it is a Nondeterministic Polynomial-hard problem, the local search algorithms are integrated for increasing convergence speed in population-based algorithms. In this paper, we propose a new task scheduling approach which combines an incremental particle swarm optimization and A * search algorithm for effective task scheduling. Moreover, the current particle swarm optimization algorithms and the heuristic algorithms gained in results on random and scientific Directed Acyclic Graph. The experiments show that the performance of the proposed approach is better when it is compared with the existing task scheduling approaches.
基于IPSO和A*搜索算法的云智能任务调度方法
在这个快速的互联网时代,云计算技术在传输、存储和访问大量官方、医疗和军事机密数据方面发挥着至关重要的作用。搜索和处理云数据的有效技术对于向云用户提供更好的服务至关重要。为了快速处理和检索数据,过去的研究者们提出了许多技术。然而,这些技术在云服务中并没有取得更好的效果。在异构环境中,如何提高任务调度效率是任务调度中的一个重要问题。为了解决这个问题,过去已经采用了许多进化算法。尽管它是一个不确定的多项式问题,但为了提高基于种群的算法的收敛速度,我们集成了局部搜索算法。本文提出了一种结合增量粒子群优化和a *搜索算法的任务调度方法。此外,现有的粒子群优化算法和启发式算法在随机、科学的有向无环图上取得了一定的结果。实验表明,与现有的任务调度方法相比,该方法具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信