Task scheduling based on virtual machine matching in clouds

Peiyun Zhang, Mengchu Zhou
{"title":"Task scheduling based on virtual machine matching in clouds","authors":"Peiyun Zhang, Mengchu Zhou","doi":"10.1109/COASE.2017.8256171","DOIUrl":null,"url":null,"abstract":"This work proposes a task scheduling method based on virtual machine (VM) matching in clouds. Its objectives are 1) to maximize task scheduling performance and 2) to minimize non-reasonable task allocation, e.g., a simple task to a high-performance VM and thus causing resource waste. A job classifier is utilized to classify tasks and match to a most suitable VM. This work uses the historical data to pre-create VMs of different types. This can save time of creating VMs during task scheduling. Tasks are efficiently matched with concrete VMs dynamically. Task scheduling is accordingly conducted. Experimental results with the Google Cluster Trace dataset show that the proposed method can effectively improve the cloud's task scheduling performance and achieve desired load balancing among various virtual machines in comparison with some existing methods.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2017.8256171","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This work proposes a task scheduling method based on virtual machine (VM) matching in clouds. Its objectives are 1) to maximize task scheduling performance and 2) to minimize non-reasonable task allocation, e.g., a simple task to a high-performance VM and thus causing resource waste. A job classifier is utilized to classify tasks and match to a most suitable VM. This work uses the historical data to pre-create VMs of different types. This can save time of creating VMs during task scheduling. Tasks are efficiently matched with concrete VMs dynamically. Task scheduling is accordingly conducted. Experimental results with the Google Cluster Trace dataset show that the proposed method can effectively improve the cloud's task scheduling performance and achieve desired load balancing among various virtual machines in comparison with some existing methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
云环境下基于虚拟机匹配的任务调度
本文提出了一种基于云环境下虚拟机匹配的任务调度方法。它的目标是:1)最大限度地提高任务调度性能;2)最大限度地减少不合理的任务分配,例如将简单的任务分配给高性能的虚拟机,从而造成资源浪费。作业分类器用于对任务进行分类并匹配到最合适的VM。使用历史数据预创建不同类型的虚拟机。这样可以节省任务调度时创建虚拟机的时间。任务与具体的虚拟机动态高效匹配。据此进行任务调度。基于Google Cluster Trace数据集的实验结果表明,与现有的一些方法相比,该方法可以有效地提高云的任务调度性能,并在各种虚拟机之间实现理想的负载均衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A study on performance evaluation and status-based decision for cyber-physical production systems Optimization of deterministic timed weighted marked graphs An optimization-simulation approach for long term care structure assignment problem for elderly people Stochastic simulation of clinical pathways from raw health databases A circuit-breaker use-case operated by a humanoid in aircraft manufacturing
×
引用
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