An improved task scheduling and load balancing algorithm under the heterogeneous cloud computing network

In recent decades, with the rapid development and popularization of Internet and computer technology, cloud computing had become a highly-demanded service due to the advantages of high computing power, cheap cost of services, scalability, accessibility as well as availability. However, a fly in the ointment was that the system is more complex while dispatching variety of tasks to servers. It means that dispatching tasks to the servers is a challenge since there has a large number of heterogeneous servers, core and diverse application services need to cooperate with each other in the cloud computing network. To deal with the huge number of tasks, an appropriate and effective scheduling algorithm is to allocate these tasks to appropriate servers within the minimum completion time, and to achieve the load balancing of workload. Based on the reasons above, a novel dispatching algorithm, called Advanced MaxSufferage algorithm (AMS), is proposed in this paper to improve the dispatching efficiency in the cloud computing network. The main concept of the AMS is to allocate the tasks to server nodes by comparing the SV value, MSV value, and average value of expected completion time of the server nodes between each task. Basically, the AMS algorithm can obtain better task completion time than previous works and can achieve loadbalancing in cloud computing network.

[1]  Rajkumar Buyya,et al.  Modeling and simulation of scalable Cloud computing environments and the CloudSim toolkit: Challenges and opportunities , 2009, 2009 International Conference on High Performance Computing & Simulation.

[2]  Imre Petkovic,et al.  CRM in the cloud , 2010, IEEE 8th International Symposium on Intelligent Systems and Informatics.

[3]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..

[4]  Naglaa M. Reda,et al.  Sort-Mid tasks scheduling algorithm in grid computing , 2014, Journal of advanced research.

[5]  Kobra Etminani,et al.  A Min-Min Max-Min Selective Algorithm for Grid Task Scheduling , 2007, 2007 3rd IEEE/IFIP International Conference in Central Asia on Internet.

[6]  Changjun Jiang,et al.  Improving Performance of Heterogeneous MapReduce Clusters with Adaptive Task Tuning , 2017, IEEE Transactions on Parallel and Distributed Systems.

[7]  Mahmood Ahmadi,et al.  An Improved Min-Min Task Scheduling Algorithm in Grid Computing , 2013, GPC.

[8]  Francine Berman,et al.  Heuristics for scheduling parameter sweep applications in grid environments , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[9]  M. Reza Salehnamadi,et al.  A Batch Mode Scheduling Algorithm for Grid Computing , 2013 .

[10]  Ladislau Bölöni,et al.  A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).