Multi Priority Based Scheduling Algorithm for Queuing Systems

Mean waiting time is of a greater concern wherever queuing system is involved. Priority Scheduling is the general method used to reduce the mean waiting time of higher priority processes. However this method just focuses on favouring higher priority processes leaving the lower priority processes out of consideration and forcing them to starve for a longer period resulting in higher average mean time. The proposed system focuses on reducing the average mean time by favouring the higher priority processes and also making sure that the lower priority processes are not being made to starve. This is done using a dynamic multi priority based Scheduling Algorithm having Earliest Deadline First (EDF) algorithm as a base. The reason EDF is taken as a base as it achieves a better balance among priority classes by considering the timing constraints of the processes as well compared to other algorithms. Cloud is developing day by day and faces many challenges. One of them is scheduling. Scheduling refers to a set of policies to control the order of work to be performed by a computer system. This presents a Generalized Priority algorithm for efficient execution of task and comparison with FCFS and Round Robin Scheduling .Algorithm is tested in and result shows that it gives better performance compared to other traditional scheduling algorithm.