Quantum time task scheduling technique in novel hybrid shortest job first and round robin

  • Authors

    • Mohd Noor Derahman
    • Ahmad Shakir Roslan
    • Fahrul Hakim Ayob
    https://doi.org/10.14419/ijet.v7i4.21546

  • Abstract

    In a cloud computing environment, there are huge number of tasks with different computing requirements need to be scheduled and provisioned to the various resources within different capabilities. Thus, the mapping between users and resources is crucial so that the performance could be improved. The hybrid algorithm Shortest-Job-First (SJF) and Round Robin (RR) are expected to address all the concerns in scheduling task namely response time, waiting time and turnaround time simultaneously. Existing schedulers has been focused on those parameters but starvation problems are mostly not their major concern. Therefore, this study attempts to produce a better performance of hybrid algorithm through the integration of two traditional algorithms namely SJF and RR with dynamic quantum (SRDQ). Our proposed SRDQ with the best quantum time approach apparently reduces the longer waiting time when involves with a large cloudlet. Thus, it is suitable for the cloud computing environments where the resource hunger applications are normally provisioned.

  • References

    1. [1] R. Buyya, R. Ranjan, and R. N. Calheiros, “Modeling and simulation of scalable cloud computing environments and the cloudsim toolkit: Challenges and opportunities,†in Proceedings of the 2009 Interna- tional Conference on High Performance Computing and Simulation, HPCS 2009, 2009.

      [2] J. Thaman and M. Singh, “Green cloud environment by using robust planning algorithm,†Egyptian Informatics Journal, vol. 18, no. 3, pp. 205–214, 2017.

      [3] R. Garg and A. K. Singh, “Multi-objective workflow grid scheduling Using ε -fuzzy dominance sort based discrete particle swarm optimiza- tion,†Journal of Supercomputing, vol. 68, no. 2, pp. 709–732, 2014. https://doi.org/10.1007/s11227-013-1059-8.

      [4] A. A. Chandio, K. Bilal, N. Tziritas, Z. Yu, Q. Jiang, S. U. Khan, and C. Z. Xu, “A comparative study on resource allocation and energy efficient job scheduling strategies in large-scale parallel computing systems,†Cluster Computing, vol. 17, no. 4, pp. 1349–1367, 2014. https://doi.org/10.1007/s10586-014-0384-x.

      [5] O. M. Elzeki, M. Z. Reshad, and M. A. Elsoud, “Improved Max-Min Algorithm in Cloud Computing,†International Journal of Computer Applications, 2012.

      [6] G. Patel, R. Mehta, and U. Bhoi, “Enhanced Load Balanced Min-min Algorithm for Static Meta Task Scheduling in Cloud Computing,†in Procedia Computer Science, 2015. https://doi.org/10.1016/j.procs.2015.07.385.

      [7] S. Santra, H. Dey, S. Majumdar, and G. S. Jha, “New simulation toolkit for comparison of scheduling algorithm on cloud computing,†in 2014 International Conference on Control, Instrumentation, Communication and Computational Technologies, ICCICCT 2014, 2014.

      [8] S. Elmougy, S. Sarhan, and M. Joundy, “A novel hybrid of Shortest job first and round Robin with dynamic variable quantum time task scheduling technique,†Journal of Cloud Computing, vol. 6, no. 1, 2017.

      [9] J. Zhang, H. Huang, and X. Wang, “Resource provision algorithms in cloud computing: A survey,†Journal of Network and Computer Applications, vol. 64, pp. 23–42, 2016. [Online]. Available: https://doi.org/10.1016/j.jnca.2015.12.018.

      [10] B. Muthulakshmi and K. Somasundaram, “A hybrid ABC-SA based optimized scheduling and resource allocation for cloud environment,†Cluster Computing, vol. 7, no. 4, pp. 1–9, 2017. https://doi.org/10.1007/s10586-017-1174-z.

      [11] D. Gabi, A. S. Ismail, A. Zainal, and Z. Zakaria, “Solving task schedul- ing problem in cloud computing environment using orthogonal taguchi- cat algorithm,†International Journal of Electrical and Computer Engi- neering, vol. 7, no. 3, pp. 1489–1497, 2017.

      [12] M. Aruna, D. Bhanu, and S. Karthik, “An improved load balanced metaheuristic scheduling in cloud,†Cluster Computing, pp. 1–9, 2017. https://doi.org/10.1007/s10586-017-1213-9.

      [13] Q. Guo, “Task scheduling based on ant colony optimization in cloud environment,†vol. 040039, 2017, p. 040039. [Online]. Available: http://aip.scitation.org/doi/abs/10.1063/1.4981635

      [14] W. Lin, B. Peng, C. Liang, and B. Liu, “Novel resource allocation model and algorithms for cloud computing,†in Proceedings - 4th International Conference on Emerging Intelligent Data and Web Tech- nologies, EIDWT 2013, 2013, pp. 77–82.

      [15] D. Khokhar and A. Kaushik, “Best Time Quantum Round Robin Cpu,†International Journal of Scientific Engineering and Applied Science (IJSEAS), vol. 3, no. 5, pp. 3–7, 2017.

  • Downloads

  • How to Cite

    Derahman, M. N., Roslan, A. S., & Ayob, F. H. (2018). Quantum time task scheduling technique in novel hybrid shortest job first and round robin. International Journal of Engineering & Technology, 7(4), 3097-3102. https://doi.org/10.14419/ijet.v7i4.21546

    Received date: 2018-11-25

    Accepted date: 2018-11-25