CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Improving Round Robin Process Scheduling Algorithm

by Barkha Chhugani, Mahima Silvester
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 166 - Number 6
Year of Publication: 2017
Authors: Barkha Chhugani, Mahima Silvester
10.5120/ijca2017914034

Barkha Chhugani, Mahima Silvester . Improving Round Robin Process Scheduling Algorithm. International Journal of Computer Applications. 166, 6 ( May 2017), 12-16. DOI=10.5120/ijca2017914034

@article{ 10.5120/ijca2017914034,
author = { Barkha Chhugani, Mahima Silvester },
title = { Improving Round Robin Process Scheduling Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { May 2017 },
volume = { 166 },
number = { 6 },
month = { May },
year = { 2017 },
issn = { 0975-8887 },
pages = { 12-16 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume166/number6/27673-2017914034/ },
doi = { 10.5120/ijca2017914034 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:12:59.033810+05:30
%A Barkha Chhugani
%A Mahima Silvester
%T Improving Round Robin Process Scheduling Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 166
%N 6
%P 12-16
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Round Robin Algorithm is used for process scheduling by assigning a fixed time quantum to every process which has to be executed. In this type of process scheduling, each process waiting in a ready queue is executed for a particular time quantum. If the burst time of the process is finished in one go then the process is removed from the ready queue. Otherwise, it is returned to the ready queue for its next quantum turn. In our proposal, we have calculated a dynamic time quantum for a process which fits to certain dynamically calculated conditions that we have defined later in the module due to which parameters like average turnaround time, average waiting time and the numbers of context switches have been decreased as compared to the standard Round Robin.

References
  1. Mostafa SM, Hamad SH, Rida SZ (2011) Improving Scheduling Criteria of Preemptive Tasks Scheduled under Round Robin Algorithm using Changeable Time Quantum. J Comput Sci Syst Biol 4:071-076. doi:10.4172/jcsb.1000078
  2. Neha Mittal , Khushbu Garg , Ashish America, “A Paper on Modified Round Robin Algorithm, IJLTEMAS, Volume IV, Issue XI, November 2015
  3. Lipika Datta, Efficient Round Robin Scheduling Algorithm with Dynamic Time Slice, I.J. Education and Management Engineering, 2015, 2, 10-19 Published Online June 2015 in MECS (http://www.mecs-press.net) DOI: 10.5815/ijeme.2015.02.02
  4. Lipika Datta, Modified RR Algorithm with Dynamic Time Quantum for Externally Prioritized Tasks, International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169 Volume: 3 Issue: 1,Pp 217 - 221
  5. Amit Kumar Sain, Dynamical Modified R.R. CPU Scheduling Algorithm, International Journal of Computer Trends and Technology- volume4, Issue2- 2013
  6. Mohd Abdul Ahad. Article: Modifying Round Robin Algorithm for Process Scheduling using Dynamic Quantum Precision. IJCA Special Issue on Issues and Challenges in Networking, Intelligence and Computing Technologies ICNICT(3):5-10, November 2012., Pp 5-10
  7. Silberschatz, A. P.B. Galvin and G. Gagne (2012), Operating System Concepts, 8th edition, Wiley India
  8. Operating Systems Sibsankar Haldar 2009, Pearson
  9. D.M. Dhamdhere operating Systems A Concept Based Approach, Second edition, Tata McGraw-Hill, 2006.
  10. Aashna Bisht, Mohd Abdul Ahad, Sielvie Sharma, Enhanced Round Robin Algorithm for Process Scheduling using varying quantum precision, Proceedings of ICRIEST AICEEMCS, 29th December,2013.pp 11-15
  11. Aashna Bisht, Mohd Abdul Ahad and Sielvie Sharma. Article: Calculating Dynamic Time Quantum for Round Robin Process Scheduling Algorithm. International Journal of Computer Applications 98(21):20-27, July 2014.
Index Terms

Computer Science
Information Sciences

Keywords

Turnaround time Waiting time context switches CPU Scheduling time quantum.

Powered by PhDFocusTM