Highly advanced cloudlet scheduling algorithm based on Particle Swarm Optimization

D. Saxena, Shilpi Saxena
{"title":"Highly advanced cloudlet scheduling algorithm based on Particle Swarm Optimization","authors":"D. Saxena, Shilpi Saxena","doi":"10.1109/IC3.2015.7346663","DOIUrl":null,"url":null,"abstract":"Cloud computing has become buzzword today. Here, dynamically scalable services and virtualized resources are provided over the internet. Cloud provides following types of services: Software-as-a-Service(SaaS), Platform-as-a-Service(PaaS) and Infrastructure-as-a-service(IaaS). This paper has prime focus on IaaS clouds which offer virtual pool of infinite, heterogeneous resources to users, that can be access on demand. The very objective of this paper is to dynamically optimize task scheduling at system level as well as user level. This paper relates advanced heuristic optimization technique i.e. Particle Swarm Optimization (PSO) which performs better computational over other evolutionary algorithm and optimization technique. In proposed algorithm, group of tasks are represented as particles, where each particle tries to reach its best position in the swarm (collection of all groups of task available for scheduling). Direction and magnitude of velocity can be performed in either of two ways: deadline based or cost based velocity updation, which altogether contributes the particle to reach its local maxima, finally reach its global maxima. This means all the available tasks are efficiently scheduled to the very best of its optimization. We recompile the cloudsim and simulate the proposed algorithm and results of this algorithm are compared with sequential task scheduling. The experimental results indicates that proposed algorithm has higher accuracy in terms of least execution time and at task execution at lower cost that considers heterogeneous resources and elasticity of IaaS clouds that can be dynamically acquired on pay-per-use basis. This algorithm is not only beneficial to user and service provider, but also provides better efficiency i.e. benefit at system level.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"274 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Eighth International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2015.7346663","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Cloud computing has become buzzword today. Here, dynamically scalable services and virtualized resources are provided over the internet. Cloud provides following types of services: Software-as-a-Service(SaaS), Platform-as-a-Service(PaaS) and Infrastructure-as-a-service(IaaS). This paper has prime focus on IaaS clouds which offer virtual pool of infinite, heterogeneous resources to users, that can be access on demand. The very objective of this paper is to dynamically optimize task scheduling at system level as well as user level. This paper relates advanced heuristic optimization technique i.e. Particle Swarm Optimization (PSO) which performs better computational over other evolutionary algorithm and optimization technique. In proposed algorithm, group of tasks are represented as particles, where each particle tries to reach its best position in the swarm (collection of all groups of task available for scheduling). Direction and magnitude of velocity can be performed in either of two ways: deadline based or cost based velocity updation, which altogether contributes the particle to reach its local maxima, finally reach its global maxima. This means all the available tasks are efficiently scheduled to the very best of its optimization. We recompile the cloudsim and simulate the proposed algorithm and results of this algorithm are compared with sequential task scheduling. The experimental results indicates that proposed algorithm has higher accuracy in terms of least execution time and at task execution at lower cost that considers heterogeneous resources and elasticity of IaaS clouds that can be dynamically acquired on pay-per-use basis. This algorithm is not only beneficial to user and service provider, but also provides better efficiency i.e. benefit at system level.
基于粒子群优化的先进云调度算法
如今,云计算已经成为一个流行词。在这里,通过internet提供动态可伸缩的服务和虚拟化资源。云提供以下类型的服务:软件即服务(SaaS)、平台即服务(PaaS)和基础设施即服务(IaaS)。本文主要关注IaaS云,它为用户提供无限的虚拟池,异构资源,可以按需访问。本文的主要目标是在系统级和用户级对任务调度进行动态优化。本文介绍了一种先进的启发式优化技术,即粒子群优化(PSO),它比其他进化算法和优化技术具有更好的计算性能。在该算法中,任务组被表示为粒子,其中每个粒子试图到达其在群(所有可调度任务组的集合)中的最佳位置。速度的方向和大小可以通过两种方式进行:基于截止日期或基于成本的速度更新,这两种方式都有助于粒子达到其局部最大值,最终达到其全局最大值。这意味着所有可用的任务都被有效地调度到最佳优化状态。我们重新编译了cloudsim并对该算法进行了仿真,并将该算法的结果与顺序任务调度进行了比较。实验结果表明,该算法考虑了IaaS云的异构资源和可按使用付费动态获取的弹性,在最短的执行时间和较低的任务执行成本方面具有较高的准确性。该算法不仅对用户和服务提供商有利,而且在系统层面提供了更高的效率,即效益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信