Dynamic Job Scheduling Algorithms Based on Round Robin for Cloud Environment
Bossy Mohamed, Noha E. AL-Attar, Wael A. Awad, Fatma A. Omara · Research Journal of Applied Sciences Engineering and Technology · 2017
This study attempts to solve the problem of the static scheduling algorithms by developing a dynamic version of Round Robin scheduling algorithm; Dynamic Priority Round Robin and Enhanced Dynamic Priority Round Robin. The proposed algorithms have been developed based on a dynamic manner of choosing the quantum time according to the current status of the requested jobs in attempting to fulfill the user's requirements and improve the overall system performance and resource utilization. The implementation of the developed algorithms is done by the Cloudsim simulator. The results record that the two versions of dynamic scheduling algorithms achieve high performance and resource utilization for the Cloud system comparing with the static scheduling algorithms like Round Robin and others. Accordingly, they decrease the idle waiting, computational and turnaround time of the requested jobs. By comparing the proposed algorithms with their corresponding static Round Robin versions, it is found that; Dynamic Priority Round Robin (DPRR) algorithm has enhanced the saving in idle waiting time, the response time and turnaround time are by 25, 51 and 32%, respectively. Similarly, the idle waiting time, response time and turnaround time are decreased in the proposed Enhance Dynamic Priority Round Robin (EDPRR) algorithm by 51, 44 and 30%, respectively. Furthermore, the resource utilization has also improved by 18% and 5% for the both of developed algorithms (DPRR and EDPRR) respectively.