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

A New Approach for Dynamic Time Quantum Allocation in Round Robin Process Scheduling Algorithm

by Ritika Gakher, Saman Rasool
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 102 - Number 14
Year of Publication: 2014
Authors: Ritika Gakher, Saman Rasool
10.5120/17884-8834

Ritika Gakher, Saman Rasool . A New Approach for Dynamic Time Quantum Allocation in Round Robin Process Scheduling Algorithm. International Journal of Computer Applications. 102, 14 ( September 2014), 27-32. DOI=10.5120/17884-8834

@article{ 10.5120/17884-8834,
author = { Ritika Gakher, Saman Rasool },
title = { A New Approach for Dynamic Time Quantum Allocation in Round Robin Process Scheduling Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { September 2014 },
volume = { 102 },
number = { 14 },
month = { September },
year = { 2014 },
issn = { 0975-8887 },
pages = { 27-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume102/number14/17884-8834/ },
doi = { 10.5120/17884-8834 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:33:07.286593+05:30
%A Ritika Gakher
%A Saman Rasool
%T A New Approach for Dynamic Time Quantum Allocation in Round Robin Process Scheduling Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 102
%N 14
%P 27-32
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Round-Robin (RR) is the vastly used process scheduling algorithm where, all processes are allocated some time shares in a circular order. If a process is able to complete its execution within this time quantum share, it is removed from the ready queue else it goes back at the end of the queue. Round-Robin scheduling is simple, gives fair allocation of CPU to the process and is starvation free. However there is few performance issues related to it. One of them is that even if there is a fractional amount of time left for a process to complete it execution, and its time share expires, it is preempted. Now this process has to wait unnecessarily to get its next chance to complete this fractional remaining execution. In this paper the proposal for the modification which will eradicate this performance issue of the conventional round robin algorithm is proposed thereby making it fairer.

References
  1. Abbas Noon, Ali Kalakech, and Seifedine Kadry, A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average, IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 1, pp. 224-229, May 2011.
  2. Haidar M. Ali and Kaies Khalid, An Improvement on Round Robin Scheduling Method, ICITNS 2003 International Conference on Information Technology and Natural Sciences.
  3. Shanmugam Arumugam and Shanthi Govindaswamy, Performance of the Modified Round Robin Scheduling Algorithm for Input Queued Switches Under Self- Similar Traffic,The International Arab Journal of Information Technology, Vol. 3, No 2, pp. 165-171 ,April 2006.
  4. KN Rout, G. Das, B. M. Sahoo, A. K. Agrawalla, ,Improving Average Waiting Time Using Dyanamic Time Quantum,ISSN (Print): 2319-2526, Volume – I, Issue-2. 2012.
  5. Ali Jbaeer Dawood, Improving Efficiency of Round Robin using Ascending Quantum and Minimum-Maximum Burst Time- Journal of University of Anbar for pure science: Vol. 6:NO. 2,2012.
  6. Bashir Alam, Fuzzy Round Robin C. P. U Scheduling Algorithm , Journal of Computer Science , pp. 1079-1085,2013
  7. Mohd Abdul Ahad, 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, pp. 5-10, November. 2012.
  8. D. Pandey and Vandana, Improved Round Robin Policy A Mathematical Approach, D. Pandey et. al. / (IJCSE) International Journal on Computer Science and Engineering, Vol. 02, No. 04, pp. 948-954, 2010.
  9. Lalit Kishor , Dinesh Goyal, Time Quantum Based Improved Scheduling Algorithm, Volume3, Issue International Journal of Advanced Research in Computer Science and Software Engineering. ISSN: 2277 128X, 4, April, 2013.
  10. Silberschatz ,Galvin and Gagne, Operating systems concepts, 8th edition, Wiley, 2009.
  11. D. M. Dhamdhare, Operating Systems, Tata McGraw Hill, Second Edition,2006.
Index Terms

Computer Science
Information Sciences

Keywords

Time Quantum Turnaround Time Number of Cycles Remaining Time Number of Context switches Wait time.

Powered by PhDFocusTM