Performance evaluation of task scheduling with priority and non-priority in cloud computing

Minimizing the total allocation cost is an unavoidable issue needing to be deal with in task scheduling of cloud computing for processing all the tasks. In this paper, the comparative study has been done among the priority algorithms and secondly between the priority and non-priority task scheduling algorithms. In order to emulate the precedence relation of task, the task scheduling algorithms enumerate the priority of tasks according to the specific attributes of task, and then sort tasks by priority. The total allocation costs for each scheduling algorithm are calculated. The experimental results based on cloudsim3.0 toolkit with NetBeans IDE8.0 shows that the ABC algorithm (priority based) achieves good performance in cost parameter with the comparison of QoS driven, virtual machine tree (both are priority based) and traditional scheduling algorithms but the comparison of ABC (priority based) and PSO (non priority based) shows that the non priority algorithm gives best performance due to less waiting time to allocation task.