Dynamic Task Scheduling for Optimal Resource Utilization in Cloud Computing Environments using Johnson Sequencing Algorithm

Abstract

CPU scheduling is among the most important op- erations operated by an operating system (OS). There are multiple CPU scheduling methods that are present, one of them are Round Robin(RR) which is an optimized in time shared atmosphere. The efficiency of Round Robin (RR) is totally dependent upon the selection of Time Quantum (TQ). In Current paper an more optimized CPU scheduling algorithm MARR (Mid Average Round Robin) will been proposed of Round Robin that will be implementing on Johnson Sequencing Algorithm. that use the dynamic time quantum in place of the static time quantum used in Round Robin. The performance of this proposed algorithm is experimentally compared with FCFS, normal Johnsons sequencing, and MARR on Johnsons sequencing. The outcomes of the approach described in the current paper show optimized performance in terms of reduced service time, which was demonstrated using graphs and tables.