Cost Aware Load Balanced Task Scheduling with Active VM Load Evaluation

A. Kaur, Bikrampal Kaur
{"title":"Cost Aware Load Balanced Task Scheduling with Active VM Load Evaluation","authors":"A. Kaur, Bikrampal Kaur","doi":"10.1145/2979779.2979861","DOIUrl":null,"url":null,"abstract":"The cloud platforms are gaining more popularity every year and adding up more customers to their portals. The cloud platforms are being flooded with the millions of user queries every second, which are becoming a major challenge to process them in the shortest possible time. The existing solutions do not evaluate the individual load on the virtual machines, while scheduling the tasks on the cloud platforms. In this paper, the new task scheduling model has been proposed, which utilizes the ant colony optimization for the load based VM allocation for each task loaded in the list for processing. The proposed model has been designed to calculate the load on the list of available VMs. The available list of the VM's is evaluated against the process cost, which checks the ability of VM in focus to process the given task. The VMs, who are eligible to process the given task, are shortlisted and the given task is assigned to the VM with the least load. The experimental results have manifested the effectiveness of the proposed model in comparison with the existing models to take the accurate offloading decisions.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2979779.2979861","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The cloud platforms are gaining more popularity every year and adding up more customers to their portals. The cloud platforms are being flooded with the millions of user queries every second, which are becoming a major challenge to process them in the shortest possible time. The existing solutions do not evaluate the individual load on the virtual machines, while scheduling the tasks on the cloud platforms. In this paper, the new task scheduling model has been proposed, which utilizes the ant colony optimization for the load based VM allocation for each task loaded in the list for processing. The proposed model has been designed to calculate the load on the list of available VMs. The available list of the VM's is evaluated against the process cost, which checks the ability of VM in focus to process the given task. The VMs, who are eligible to process the given task, are shortlisted and the given task is assigned to the VM with the least load. The experimental results have manifested the effectiveness of the proposed model in comparison with the existing models to take the accurate offloading decisions.
成本感知负载均衡任务调度与主动虚拟机负载评估
云平台每年都越来越受欢迎,其门户网站的客户也越来越多。云平台正在被每秒数百万的用户查询淹没,这正在成为在尽可能短的时间内处理它们的主要挑战。现有的解决方案在调度云平台上的任务时,不评估虚拟机上的单个负载。本文提出了一种新的任务调度模型,该模型利用蚁群算法对加载在处理列表中的每个任务进行基于负载的VM分配。该模型被设计用于计算可用虚拟机列表上的负载。可用的VM列表将根据流程成本进行评估,流程成本检查重点VM处理给定任务的能力。有资格处理给定任务的虚拟机将被列入候选名单,并将给定任务分配给负载最少的虚拟机。实验结果表明,该模型与现有模型相比,能够做出准确的卸载决策。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信