改进云计算环境下作业调度问题的算法

Shahab Tareghian, Zarrintaj Bornaee
{"title":"改进云计算环境下作业调度问题的算法","authors":"Shahab Tareghian, Zarrintaj Bornaee","doi":"10.1109/KBEI.2015.7436126","DOIUrl":null,"url":null,"abstract":"Increasing development of cloud computing has enabled service providers to efficiently present their services in cloud platform; however, they still must face a prominent issue which is providing favorable quality of service parameters. The main challenge is distributing request in such a way that resources and memory are optimally utilized while QoS requirements such as make-span are minimized. Recent research works on cloud computing have mostly considered one criterion. In this paper a multi-objective scheduling scheme is investigated and a static method for distributing different requests in cloud platform is proposed. Exploiting particle swarm optimization, the proposed method reduces make-span in addition to decreasing used memory. Simulation results revealed that the proposed method significantly reduces make-span and memory usage in comparison to its counterparts.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Algorithm to improve job scheduling problem in cloud computing environment\",\"authors\":\"Shahab Tareghian, Zarrintaj Bornaee\",\"doi\":\"10.1109/KBEI.2015.7436126\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Increasing development of cloud computing has enabled service providers to efficiently present their services in cloud platform; however, they still must face a prominent issue which is providing favorable quality of service parameters. The main challenge is distributing request in such a way that resources and memory are optimally utilized while QoS requirements such as make-span are minimized. Recent research works on cloud computing have mostly considered one criterion. In this paper a multi-objective scheduling scheme is investigated and a static method for distributing different requests in cloud platform is proposed. Exploiting particle swarm optimization, the proposed method reduces make-span in addition to decreasing used memory. Simulation results revealed that the proposed method significantly reduces make-span and memory usage in comparison to its counterparts.\",\"PeriodicalId\":168295,\"journal\":{\"name\":\"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KBEI.2015.7436126\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KBEI.2015.7436126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

云计算的不断发展使服务提供商能够在云平台上高效地呈现服务;然而,他们仍然必须面对一个突出的问题,即提供良好的服务质量参数。主要的挑战是以这样一种方式分发请求,即资源和内存得到最佳利用,同时QoS需求(如make-span)最小化。最近关于云计算的研究大多考虑了一个标准。本文研究了一种多目标调度方案,提出了一种在云平台上静态分配不同请求的方法。该方法利用粒子群优化方法,在减少已使用内存的同时,减少了生成跨度。仿真结果表明,与同类方法相比,该方法显著减少了make-span和内存占用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Algorithm to improve job scheduling problem in cloud computing environment
Increasing development of cloud computing has enabled service providers to efficiently present their services in cloud platform; however, they still must face a prominent issue which is providing favorable quality of service parameters. The main challenge is distributing request in such a way that resources and memory are optimally utilized while QoS requirements such as make-span are minimized. Recent research works on cloud computing have mostly considered one criterion. In this paper a multi-objective scheduling scheme is investigated and a static method for distributing different requests in cloud platform is proposed. Exploiting particle swarm optimization, the proposed method reduces make-span in addition to decreasing used memory. Simulation results revealed that the proposed method significantly reduces make-span and memory usage in comparison to its counterparts.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Numerical investigation of water drop movement within a microchannel under electrowetting phenomenon An improvement on LEACH protocol (EZ-LEACH) Transient modeling of transmission lines components with respect to corona phenomenon and grounding system to reduce the transient voltages caused by lightning Impulse A modified digital to digital encoding method to improve the Wireless Body Area Network (WBAN) transmission Synchronization of chaotic Gyroscopes via an adaptive robust controller
×
引用
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