Priority Based Job Scheduling Techniques In Cloud Computing: A Systematic Review

Cloud Computing is the use of computing resources (Hardware and Software) that are delivered as a service over a network (typically the internet) to the customers. It intends to share large scale equipments and resources for computation, storage, information and knowledge for scientific researches [1]. In cloud computing, there are many jobs requires to be executed by the available resources to achieve best performance, minimal total time for completion, shortest response time, utilization of resource usage and etc. Because of these different objectives and high performance of computing environment, we need to design, develop, propose a scheduling algorithm to outperform appropriate allocation map of jobs due to different factors. In job scheduling priority is the biggest issue because some jobs need to scheduled first then the other jobs which can wait for a long time. In this paper, a systematic review of various priority based job scheduling algorithms is presented. These algorithms have different perspective, working principles etc. This study concludes that all the existing techniques mainly focus on priority of jobs and reduces service response time and improving performance etc. There are many parameters that can be mentioned as factor of scheduling problem to be considered such as load balancing, system throughput, service reliability, service cost, service utilization and so forth.