基于实时聚类和NetFlow预测的自适应任务调度系统

Hao Zhang, G. He
{"title":"基于实时聚类和NetFlow预测的自适应任务调度系统","authors":"Hao Zhang, G. He","doi":"10.1109/ICCC47050.2019.9064183","DOIUrl":null,"url":null,"abstract":"With more and more enterprise users begin to adapt cloud computing service as their target platform for important business activity, the Cloud Computing Platform (CCP) is facing severe loading and stability problems. As a result, an excellent task scheduling system is much needed. To build such a system, the widely used method is to design detailed plan manually based on each task. However, this method has many disadvantages. Firstly, people have to add new task and rearrange them every time new user comes, with too much time wasted. Secondly, changing environment like time, task numbers may also influence the final running results. In this paper, we creatively introduce an adaptive task scheduling system which is driven by history user data [1]. By collecting these data, we conduct clustering at intervals of time to achieve the latest user task size classification. We also predict the netflow amount for next few hours, based on historical time series. Later, we arrange the order of current tasks dynamically through a weighted scoring mechanism. Experiments result on the real-life dataset demonstrate the superiority of our proposed method over state-of-the-art method.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"40 1","pages":"77-80"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An Adaptive Task Scheduling System Based on Real-time Clustering and NetFlow Prediction\",\"authors\":\"Hao Zhang, G. He\",\"doi\":\"10.1109/ICCC47050.2019.9064183\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With more and more enterprise users begin to adapt cloud computing service as their target platform for important business activity, the Cloud Computing Platform (CCP) is facing severe loading and stability problems. As a result, an excellent task scheduling system is much needed. To build such a system, the widely used method is to design detailed plan manually based on each task. However, this method has many disadvantages. Firstly, people have to add new task and rearrange them every time new user comes, with too much time wasted. Secondly, changing environment like time, task numbers may also influence the final running results. In this paper, we creatively introduce an adaptive task scheduling system which is driven by history user data [1]. By collecting these data, we conduct clustering at intervals of time to achieve the latest user task size classification. We also predict the netflow amount for next few hours, based on historical time series. Later, we arrange the order of current tasks dynamically through a weighted scoring mechanism. Experiments result on the real-life dataset demonstrate the superiority of our proposed method over state-of-the-art method.\",\"PeriodicalId\":6739,\"journal\":{\"name\":\"2019 IEEE 5th International Conference on Computer and Communications (ICCC)\",\"volume\":\"40 1\",\"pages\":\"77-80\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 5th International Conference on Computer and Communications (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCC47050.2019.9064183\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC47050.2019.9064183","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

随着越来越多的企业用户开始将云计算服务作为其重要业务活动的目标平台,云计算平台(CCP)面临着严峻的负载和稳定性问题。因此,一个优秀的任务调度系统是非常必要的。为了构建这样一个系统,广泛使用的方法是根据每个任务手动设计详细的计划。然而,这种方法有很多缺点。首先,每次新用户到来,人们都要添加新的任务并重新安排任务,浪费了太多的时间。其次,时间、任务号等环境的变化也会影响最终的运行结果。本文创造性地引入了一种由历史用户数据驱动的自适应任务调度系统[1]。通过收集这些数据,我们每隔一段时间进行聚类,以实现最新的用户任务大小分类。我们还根据历史时间序列预测未来几个小时的净流量。然后,通过加权评分机制对当前任务进行动态排序。在实际数据集上的实验结果表明,该方法优于现有方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Adaptive Task Scheduling System Based on Real-time Clustering and NetFlow Prediction
With more and more enterprise users begin to adapt cloud computing service as their target platform for important business activity, the Cloud Computing Platform (CCP) is facing severe loading and stability problems. As a result, an excellent task scheduling system is much needed. To build such a system, the widely used method is to design detailed plan manually based on each task. However, this method has many disadvantages. Firstly, people have to add new task and rearrange them every time new user comes, with too much time wasted. Secondly, changing environment like time, task numbers may also influence the final running results. In this paper, we creatively introduce an adaptive task scheduling system which is driven by history user data [1]. By collecting these data, we conduct clustering at intervals of time to achieve the latest user task size classification. We also predict the netflow amount for next few hours, based on historical time series. Later, we arrange the order of current tasks dynamically through a weighted scoring mechanism. Experiments result on the real-life dataset demonstrate the superiority of our proposed method over state-of-the-art method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信