Optimized Round Robin Scheduling Algorithm Using Dynamic Time Quantum Approach in Cloud Computing Environment

Full Text (PDF, 541KB), PP.22-34

Views: 0 Downloads: 0

Author(s)

Dipto Biswas 1,2 Md. Samsuddoha 2,* Md. Rashid Al Asif 2 Md. Manjur Ahmed 2

1. Department of Computer Science and Engineering, University of Barishal, Barishal-8254, Bangladesh

2. Department of Information and Communication Engineering, Daffodil International University, Dhaka, Bangladesh

* Corresponding author.

DOI: https://doi.org/10.5815/ijisa.2023.01.03

Received: 4 Sep. 2022 / Revised: 15 Nov. 2022 / Accepted: 12 Dec. 2022 / Published: 8 Feb. 2023

Index Terms

Cloud Computing, Task Scheduling, Round Robin, Time Quantum

Abstract

Cloud computing refers to a sophisticated technology that deals with the manipulation of data in internet-based servers dynamically and efficiently. The utilization of the cloud computing has been rapidly increased because of its scalability, accessibility, and incredible flexibility. Dynamic usage and process sharing facilities require task scheduling which is a prominent issue and plays a significant role in developing an optimal cloud computing environment. Round robin is generally an efficient task scheduling algorithm that has a powerful impact on the performance of the cloud computing environment. This paper introduces a new approach for round robin based task scheduling algorithm which is suitable for cloud computing environment. The proposed algorithm determines time quantum dynamically based on the differences among three maximum burst time of tasks in the ready queue for each round. The concerning part of the proposed method is utilizing additive manner among the differences, and the burst times of the processes during determining the time quantum. The experimental results showed that the proposed approach has enhanced the performance of the round robin task scheduling algorithm in reducing average turn-around time, diminishing average waiting time, and minimizing number of contexts switching. Moreover, a comparative study has been conducted which showed that the proposed approach outperforms some of the similar existing round robin approaches. Finally, it can be concluded based on the experiment and comparative study that the proposed dynamic round robin scheduling algorithm is comparatively better, acceptable and optimal for cloud environment.

Cite This Paper

Dipto Biswas, Md. Samsuddoha, Md. Rashid Al Asif, Md. Manjur Ahmed, "Optimized Round Robin Scheduling Algorithm Using Dynamic Time Quantum Approach in Cloud Computing Environment", International Journal of Intelligent Systems and Applications(IJISA), Vol.15, No.1, pp.22-34, 2023. DOI:10.5815/ijisa.2023.01.03

Reference

[1]Sadeeq, Mohammed Mohammed, et al. "IoT and Cloud computing issues, challenges and opportunities: A review." Qubahan Academic Journal 1.2 (2021): 1-7.
[2]Singh, Ravi Pratap, et al. "Cloud computing in solving problems of COVID-19 pandemic." Journal of Industrial Integration and Management 6.02 (2021): 209-219.
[3]Zou, Lei, et al. "Tracking Control Under Round-Robin Scheduling: Handling Impulsive Transmission Outliers." IEEE Transactions on Cybernetics (2021).
[4]Alhaidari, Fahd, and Taghreed Zayed Balharith. "Enhanced Round-Robin Algorithm in the Cloud Computing Environment for Optimal Task Scheduling." Computers 10.5 (2021): 63.
[5]Jeevitha, J. K., and G. Athisha. "A novel scheduling approach to improve the energy efficiency in cloud computing data centers." Journal of Ambient Intelligence and Humanized Computing 12.6 (2021): 6639-6649.
[6]Balharith, Taghreed, and Fahd Alhaidari. "Round robin scheduling algorithm in CPU and cloud computing: a review." 2019 2nd International Conference on Computer Applications \& Information Security (ICCAIS). IEEE, 2019.
[7]Rangra, Abhilasha, Vivek Kumar Sehgal, and Shailendra Shukla. "A Novel approach of cloud based scheduling using deep-learning approach in e-commerce domain." International Journal of Information System Modeling and Design (IJISMD) 10.3 (2019): 59-75.
[8]Alam Chowdhury, Rezaul, and Mohammad Kaykobad. "Sorting using heap structure." International journal of computer mathematics 77.3 (2001): 347-354.
[9]Pradhan, Pandaba, Prafulla Ku Behera, and B. N. B. Ray. "Modified round robin algorithm for resource allocation in cloud computing." Procedia Computer Science 85 (2016): 878-890.
[10]Shamsuddoha, Md, et al. "CLBS-3: A three-tier load balancer for ensuring fault-tolerance of software running in open-source cloud." Proceedings of the The International Conference on Engineering & MIS 2015. 2015.
[11]Verma, Rishi, Sunny Mittal, and Vikram Singh. "A Round Robin Algorithm using Mode Dispersion for Effective Measure." International Journal for Research in Applied Science and Engineering Technology (IJRASET) (2014): 166-174.
[12]Mohanty, Rakesh, et al. "Priority based dynamic round robin (PBDRR) algorithm with intelligent time slice for soft real time systems." arXiv preprint arXiv:1105.1736 (2011).
[13]Paul, Tithi, R. Hossain, and Md Samsuddoha. "Improved round robin scheduling algorithm with progressive time quantum." International Journal of Computer Applications 975 (2019): 8887.
[14]Biswas, Dipto, et al. "An Improved Round Robin Scheduling Algorithm Based on Maximum Difference of Two Adjacent Processes." Barishal University Journal Part 1.5 (2018): 257-271.
[15]Fataniya, Bhavin, and Manoj Patel. "Dynamic time quantum approach to improve round robin scheduling algorithm in cloud environment." IJSRSET 4.4 (2018): 963-969.
[16]Mohanty, Rakesh, et al. "Design and performance evaluation of a new proposed shortest remaining burst round robin (SRBRR) scheduling algorithm." Proceedings of International Symposium on Computer Engineering & Technology (ISCET). Vol. 17. 2010.
[17]EL AMRANI, Chaker, and Hicham GIBET TANI."Smarter round robin scheduling algorithm for cloud computing and big data." Journal of Data Mining & Digital Humanities (2018).
[18]Samal, Pooja, and Pranati Mishra. "Analysis of variants in Round Robin Algorithms for load balancing in Cloud Computing." International Journal of computer science and Information Technologies 4.3 (2013): 416-419.
[19]Biswas, Dipto, and Md Samsuddoha. "Determining Proficient Time Quantum to Improve the Performance of Round Robin Scheduling Algorithm." International Journal of Modern Education \& Computer Science 11.10 (2019).
[20]Pradhan, Pandaba, Prafulla Ku Behera, and B. N. B. Ray. "Modified round robin algorithm for resource allocation in cloud computing." Procedia Computer Science 85 (2016): 878-890.
[21]Behera, Patwari, et al. "Design and performance evaluation of a new proposed shortest remaining burst round robin (SRBRR) scheduling algorithm." Proceedings of International Symposium on Computer Engineering & Technology (ISCET). Vol. 17. 2010.
[22]Matarneh, Rami J. "Self-adjustment time quantum in round robin algorithm depending on burst time of the now running processes." American Journal of Applied Sciences 6.10 (2009): 1831.
[23]Sunny Mittal, and Vikram Singh. "A Round Robin Algorithm using Mode Dispersion for Effective Measure." International Journal for Research in Applied Science and Engineering Technology (IJRASET) (2014): 166-174.