Abstract

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.

Keywords:

Cloud computing, dynamic scheduling, round robin, static scheduling,

References

1. Chen, H., R.H.L. Chiang and V.C. Storey, 2012. Business intelligence and analytics: From big data to big impact. MIS Quart., 36(4): 1165-1188.
   Direct Link
2. Hashem, I.A.T., I. Yaqoob, N.B. Anuar, S. Mokhtar, A. Gani and S.U. Khan, 2015. The rise of "big data" on cloud computing: Review and open research issues. Inform. Syst., 47: 98-115.
   CrossRef    Direct Link
3. Noon, A., A. Kalakech and S. Kadry, 2011. A new round robin based scheduling algorithm for operating systems: Dynamic quantum using the mean average. Int. J. Comput. Sci. Issue., 8(3): 224-229.
   
4. Abdelkader, D.M. and F. Omara, 2012. Dynamic task scheduling algorithm with load balancing for heterogeneous computing system. Egypt. Inform. J., 13(2): 135-145.
   CrossRef    
5. Aravind, A. and J. Chelladurai, 2016. Fair-share Round Robin CPU Scheuling Algorithms. Retrieved from: http://web.unbc.ca/~csalex/papers/aj05.pdf. (Last Accessed on: July 19-Aug. 18, 2016 at 12 AM).
   
6. Buyya, R., R. Ranjan and R.N. Calheiros, 2009. Modeling and simulation of scalable cloud computing environments and the cloudsim toolkit: Challenges and opportunities. Proceeding of the International Conference on High Performance Computing and Simulation (HPCS, 2009), pp: 1-11.
   Direct Link
7. Chang, V. and G. Wills, 2016. A model to compare cloud and non-cloud storage of Big Data. Future Gener. Comp. Sy., 57: 56-76.
   CrossRef    
8. Chen, J., D. Wang and W. Zhao, 2013. A task scheduling algorithm for hadoop platform. J. Comput., 8(4): 929-936.
   Direct Link
9. El-Attar, N., W. Awad and F. Omara, 2014. RPOAWLB: Resource provisioning optimization approach based on RPOA with load balance. Int. J. Comput. Appl., 105(7): 34-41.
   
10. Ernemann, C., V. Hamscher, U. Schwiegelshohn, R. Yahyapour and A. Streit, 2002. On advantages of grid computing for parallel job scheduling. Proceeding of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, China.
    CrossRef    
11. Janakiraman, P., 2016. Big Data Cloud Database and Computing. Retrieved from: https://www.qubole.com/resources/article/big-data-cloud-database-computing/.
    Direct Link
12. Katyal, M. and A. Mishra, 2013. A comparative study of load balancing algorithms in cloud computing environment. Int. J. Distrib. Cloud Comput., 1(2): 14.
    Direct Link
13. Lee, Z., Y. Wang and W. Zhou, 2011. A dynamic priority scheduling algorithm on service request scheduling in cloud computing. Proceeding of the International Conference on Electronic and Mechanical Engineering and Information Technology, China.
    CrossRef    
14. Li, H., 2016. PWBRR Algorithm of Hadoop Platform. Retrieved from: https://www.thelibrarybook.net/pdf-research-on-job-schedulingalgorithm-in-hadoop.html. (Last Accessed on: July 17, 2016 at 4 AM).
    
15. Liu, X., C. Wang, B.B. Zhou, J. Chen, T. Yang and A.Y. Zomaya, 2013. Priority-based consolidation of parallel workloads in the cloud. IEEE T. Parall. Distrib. Syst., 24(9): 1874-1883.
    CrossRef    
16. Matarneh, R.J., 2009. Self-adjustment time quantum in round robin algorithm depending on burst time of the now running processes. Am. J. Appl. Sci., 6(10): 1831-1837.
    CrossRef    
17. Mohamed, B., W. Awad, S.A. El Hafeez and F. Omara, 2016. Job schedulers based on round robin strategy on the cloud environment. Eur. J. Sci. Res., 141(2): 141-153.
    
18. Pinedo, M., 2012. Scheduling: Theory, Algorithms, and Systems. 4th Edn., Springer, New York, London.
    CrossRef    
19. Samal, P. and P. Mishra, 2013. Analysis of variants in round robin algorithms for load balancing in cloud computing. Int. J. Comput. Sci. Inform. Technol., 4(3): 416-419.
    Direct Link
20. Salot, P., 2013. A survey of various scheduling algorithm in cloud computing environment. Int. J. Res. Eng. Technol., 2(2): 131-135.
    CrossRef    
21. Siahaan, A.P.U., 2016. Comparison analysis of CPU scheduling: FCFS, SJF and round robin. Int. J. Eng. Develop. Res., 4(3): 124-131.
    Direct Link
22. Singh, P., V. Singh and A. Pandey, 2014. Analysis and comparison of CPU scheduling algorithms. Int. J. Emerg. Technol. Adv. Eng., 4(1): 91-95.
    Direct Link
23. Stankovic, J.A., M. Spuri, K. Ramamritham and G. Buttazzo, 1998. Deadline Scheduling for Real-Time Systems. 1st Edn., In: EDF and Related Algorithms. The Springer International Series in Engineering and Computer Science. Springer, US, 460: 273.
    CrossRef    
24. Vernier, D., 2016. How Does Cloud Computing Work? Retrieved from: http://www.thoughtsoncloud.com/2014/02/how-does-cloud-computing-work/.
    Direct Link

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.