{"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}
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.