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.

[1]  G. Box,et al.  Distribution of Residual Autocorrelations in Autoregressive-Integrated Moving Average Time Series Models , 1970 .

[2]  Erik van Zwet,et al.  A simple and effective method for predicting travel times on freeways , 2004, IEEE Transactions on Intelligent Transportation Systems.

[3]  Stefano Battiston,et al.  A model of a trust-based recommendation system on a social network , 2006, Autonomous Agents and Multi-Agent Systems.

[4]  Shiliang Sun,et al.  Variational Inference for Infinite Mixtures of Gaussian Processes With Applications to Traffic Flow Prediction , 2011, IEEE Transactions on Intelligent Transportation Systems.

[5]  Jiangze Du,et al.  Forecasting Electricity Market Risk Using Empirical Mode Decomposition (EMD)—Based Multiscale Methodology , 2016 .

[6]  Bin Zhang,et al.  Task Scheduling in Grid Based on Particle Swarm Optimization , 2006, 2006 Fifth International Symposium on Parallel and Distributed Computing.

[7]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[8]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[9]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[10]  Eleni I. Vlahogianni,et al.  Short‐term traffic forecasting: Overview of objectives and methods , 2004 .

[11]  Qiang Yang,et al.  Learning action models from plan examples using weighted MAX-SAT , 2007, Artif. Intell..

[12]  Xin-She Yang,et al.  Nature-Inspired Metaheuristic Algorithms , 2008 .

[13]  Shuliang Wang,et al.  Data Mining and Knowledge Discovery , 2005, Mathematical Principles of the Internet.