Dynamic Service Scheduling in Cloud Computing Using a Novel Hybrid Algorithm

Helan Liang, Yingwu Zhang, Yanhua Du
{"title":"Dynamic Service Scheduling in Cloud Computing Using a Novel Hybrid Algorithm","authors":"Helan Liang, Yingwu Zhang, Yanhua Du","doi":"10.1109/ICEBE.2015.51","DOIUrl":null,"url":null,"abstract":"Dynamic service scheduling is a challenging problem to the high-efficient implementation of service based business applications. Recent researches on dynamic service scheduling mostly focus on the service allocation, but they seldom optimize the timetable which defines the starting time of each service instance, and the existing methods proposed are time-consuming and with low calculation precision. In this paper, a novel hybrid algorithm for dynamic service scheduling is proposed. Our algorithm can improve the service allocation by the knowledge from self-learning and social learning and make the timetable more properly by reducing idle time of services. Experimental results show our algorithm can solve the dynamic service scheduling problem more precisely and with less execution time than the existing works.","PeriodicalId":153535,"journal":{"name":"2015 IEEE 12th International Conference on e-Business Engineering","volume":"32 5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 12th International Conference on e-Business Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEBE.2015.51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Dynamic service scheduling is a challenging problem to the high-efficient implementation of service based business applications. Recent researches on dynamic service scheduling mostly focus on the service allocation, but they seldom optimize the timetable which defines the starting time of each service instance, and the existing methods proposed are time-consuming and with low calculation precision. In this paper, a novel hybrid algorithm for dynamic service scheduling is proposed. Our algorithm can improve the service allocation by the knowledge from self-learning and social learning and make the timetable more properly by reducing idle time of services. Experimental results show our algorithm can solve the dynamic service scheduling problem more precisely and with less execution time than the existing works.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于混合算法的云计算动态服务调度
动态服务调度是实现基于服务的业务应用程序的一个具有挑战性的问题。目前对动态服务调度的研究主要集中在服务分配问题上,但很少对时间表进行优化,该时间表定义了每个服务实例的开始时间,现有的方法耗时长,计算精度低。提出了一种新的用于动态服务调度的混合算法。该算法利用自学习和社会学习的知识来改进服务分配,并通过减少服务空闲时间来制定更合理的时间表。实验结果表明,与现有算法相比,该算法可以更精确地解决动态服务调度问题,且执行时间更短。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Joint Design Model of Multi-period Reverse Logistics Network with the Consideration of Carbon Emissions for E-Commerce Enterprises A Four-Layer Flexible Spatial Data Framework towards IoT Application Responding to Subjective Changes of Customer Requirements in Dynamic Service Execution Environment An Improved Ant Colony Clustering Algorithm Based on LF Algorithm An Empirical Study on Users' Online Payment Behavior of Tourism Website
×
引用
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