Task Scheduling Algorithm Based on PSO in Cloud Environment

In recent years, cloud computing has developed rapidly under the vigorous promotion of industry and academia. With the expansion of cloud computing, users' special needs for cloud resources have gradually improved. As a business model, cloud computing must pay more attention to user demands for services and provide users with high-quality services. As one of the key technologies in cloud computing, task scheduling is mainly responsible for assigning user tasks to the appropriate resources. However, the existing scheduling algorithms do not take full account of users' different needs. In this paper, we consider multidimensional QoS requirements, and introduce Berger model to judge the fairness of the resource allocation results. We also improve the Particle Swarm Optimization(PSO) algorithm by adjusting its parameters dynamically and making the position coding discrete. Then, we propose a task scheduling algorithm based on QoS-DPSO. The simulation results show that this algorithm can effectively carry out user tasks and reflect more fairness.

[1]  HuBin,et al.  Job scheduling algorithm based on Berger model in cloud environment , 2011 .

[2]  Imtiaz Ahmad,et al.  Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.

[3]  Baomin Xu,et al.  Job scheduling algorithm based on Berger model in cloud environment , 2011, Adv. Eng. Softw..

[4]  Lakshmi Sobhana Kalli,et al.  Market-Oriented Cloud Computing : Vision , Hype , and Reality for Delivering IT Services as Computing , 2013 .

[5]  James Kennedy,et al.  Defining a Standard for Particle Swarm Optimization , 2007, 2007 IEEE Swarm Intelligence Symposium.

[6]  Priyanka A. Chaudhari Survey on Job Scheduling Algorithms of Cloud Computing , 2013 .

[7]  Donald F. Ferguson,et al.  Microeconomic algorithms for load balancing in distributed computer systems , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[8]  Saman K. Halgamuge,et al.  Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients , 2004, IEEE Transactions on Evolutionary Computation.

[9]  Rajkumar Buyya,et al.  Workflow scheduling algorithms for grid computing , 2008 .

[10]  Yechiam Yemini,et al.  Proceedings of the first international conference on Information and computation economies , 1998 .

[11]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[12]  Andreas Willig,et al.  A Framework for Resource Allocation Strategies in Cloud Computing Environment , 2011, 2011 IEEE 35th Annual Computer Software and Applications Conference Workshops.

[13]  N. Nisan,et al.  The POPCORN market—an online market for computational resources , 1998, ICE '98.

[14]  Yuehui Chen,et al.  A Task Scheduling Algorithm Based on PSO for Grid Computing , 2008 .

[15]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[16]  Rajkumar Buyya,et al.  CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms , 2011, Softw. Pract. Exp..

[17]  Rajkumar Buyya,et al.  Economic-based Distributed Resource Management and Scheduling for Grid Computing , 2002, ArXiv.

[18]  Rajkumar Buyya,et al.  Market-Oriented Cloud Computing: Vision, Hype, and Reality for Delivering IT Services as Computing Utilities , 2008, 2008 10th IEEE International Conference on High Performance Computing and Communications.

[19]  Ivan E. Sutherland,et al.  A futures market in computer time , 1968, Commun. ACM.