CFP last date
22 April 2024
Reseach Article

Improved Round Robin Scheduling Algorithm with Progressive Time Quantum

by Tithi Paul, Rahat Hossain Faisal, Md. Samsuddoha
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 178 - Number 49
Year of Publication: 2019
Authors: Tithi Paul, Rahat Hossain Faisal, Md. Samsuddoha
10.5120/ijca2019919419

Tithi Paul, Rahat Hossain Faisal, Md. Samsuddoha . Improved Round Robin Scheduling Algorithm with Progressive Time Quantum. International Journal of Computer Applications. 178, 49 ( Sep 2019), 30-36. DOI=10.5120/ijca2019919419

@article{ 10.5120/ijca2019919419,
author = { Tithi Paul, Rahat Hossain Faisal, Md. Samsuddoha },
title = { Improved Round Robin Scheduling Algorithm with Progressive Time Quantum },
journal = { International Journal of Computer Applications },
issue_date = { Sep 2019 },
volume = { 178 },
number = { 49 },
month = { Sep },
year = { 2019 },
issn = { 0975-8887 },
pages = { 30-36 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume178/number49/30886-2019919419/ },
doi = { 10.5120/ijca2019919419 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:53:34.903707+05:30
%A Tithi Paul
%A Rahat Hossain Faisal
%A Md. Samsuddoha
%T Improved Round Robin Scheduling Algorithm with Progressive Time Quantum
%J International Journal of Computer Applications
%@ 0975-8887
%V 178
%N 49
%P 30-36
%D 2019
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Process management is considered as an important function in the operating system where several scheduling algorithms are used to maintain it. Round Robin is one of the most conventional CPU scheduling algorithms which is frequently used in operating system. The performance of round robin algorithm differs on the choice of time quantum which is clarified by the researchers. In this paper, a new round robin scheduling algorithm has been proposed where time quantum is selected dynamically. An experimental evaluation has been conducted to evaluate the performance of the proposed algorithm. Also a comparative analysis has been performed where the obtained result of this proposed algorithm has been compared with some existing algorithms. The experimental result shows that the performance of the proposed algorithm performs much better than some mentioned algorithms in terms of average waiting time and average turnaround time.

References
  1. Silberschatz, Abraham, Greg Gagne, and Peter B. Galvin. Operating system concepts. Wiley, 2018.
  2. S. R. Chavan, P. C. Tikekar, An Improved Optimum Multilevel Dynamic Round Robin Scheduling Algorithm, International Journal of Scientific & Engineering Research, Volume 4, Issue 12, December-2013 ISSN 2229-5518.
  3. Sukumar Babu B., Neelima Priyanka N., and Sunil Kumar B., "Efficient Round Robin CPU Scheduling Algorithm," International Journal of Engineering Research and Development, vol. 4, Ino. 9, Nov. 2012, p. 36-42.
  4. Ajit Singh, Priyanka Goyal, Sahil Batra, An Optimized Round Robin Scheduling Algorithm for CPU Scheduling, (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 07, 2010, 2383-2385.
  5. Abbas Noon, Ali Kalakech and Seifedine Kadry, “A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average,” International Journal of Computer Science, vol. 8, no. 1, May 2011, p. 224-229.
  6. Prof. Rakesh Mohanty, Prof. H. S. Behera, Khusbu Patwari, Manas Ranjan Das, Monisha Dash, Sudhashree, Design and Performance Evaluation of a New Proposed Shortest Remaining Burst Round Robin (SRBRR) Scheduling Algorithm.
  7. Ajit Singh, Priyanka Goyal, and Sahil Batra, "Optimized Round Robin Scheduling Algorithm for CPU Scheduling," International Journal on Computer Science and Engineering, vol. 02, no. 07, 2010, p. 2383-2385.
  8. Saroj Hiranwal and Dr. K.C. Roy, “Adaptive Round Robin Scheduling using Shortest Burst Approach Based on Smart Time Slice,” International Journal of Computer Science and Communication, vol. 2, no. 2, July-Dec. 2011, p. 319-323.
  9. Sukumar Babu B., Neelima Priyanka N., and Dr. P. Suresh Varma, "Optimized Round Robin CPU Scheduling Algorithm," Global Journal of Computer Science and Technology, vol. 12, Issue 11, 2012, p. 21-25.
  10. Sukumar Babu B., Neelima Priyanka N., and Sunil Kumar B., "Efficient Round Robin CPU Scheduling Algorithm," International Journal of Engineering Research and Development, vol. 4, Ino. 9, Nov. 2012, p. 36-42.
  11. 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.
  12. Christopher McGuire and Jeonghwa Lee, Comparisons of Improved Round Robin Algorithms, Proceedings of the World Congress on Engineering and Computer Science 2014 Vol I WCECS 2014, 22-24 October 2014, San Francisco, USA.
  13. Bhavin Fataniya1, Manoj Patel2, Survey on Different Method to Improve Performance of The Round Robin Scheduling Algorithm, International Journal of Scientific Research in Science, Engineering and Technology.
  14. 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).
  15. Salman Arif, Saad Rehman and Farhan Riaz "Design of A Modulus Based Round Robin Scheduling Algorithm", IEEE, 9th Malaysian Software Engineering Conference, Dec. 2015.
  16. Pandaba Pradhan, Prafulla Ku. Behera and B N B Ray, "Modified Round Robin Algorithm for Resource Allocation in Cloud Computing ", ScienceDirect, Procedia Computer Science (2016 ) 878 – 890,2016.
  17. Amar Ranjan Dash, Sandipta Kumar Sahu, and Sanjay Kumar Samantha, An Optimized Round Robin CPU Scheduling Algorithm with Dynamic Time Quantum, International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol. 5, No.1, February 2015.
  18. H.S.Behera, Rakesh Mohanty, Sabyasachi Sahu, and Sourav Kumar Bhoi, "Comparative Performance Analysis of Multi-dynamic Time Quantum Round Robin (mdtqrr) Algorithm with Arrival Time," Indian Journal of Computer Science and Engineering, vol. 2, no. 2, Apr-May 2011.
  19. 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.
  20. Ghanbari, Shamsollah, and Mohamed Othman. "A priority based job scheduling algorithm in cloud computing." Procedia Engineering 50.0 (2012): 778-785.
  21. Rakesh Mohanty, H. S. Behera, Debashree Nayak, “A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis” International Journal of Computer Applications (0975 – 8887), Volume 5– No.5, August 2010.
Index Terms

Computer Science
Information Sciences

Keywords

Operating System CPU scheduling Round Robin Time Quantum Waiting Time Turnaround time Context Switching