The week's pick
Reseach Article
Improved Round Robin Scheduling using Dynamic Time Quantum
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 38 - Number 5 |
| Year of Publication: 2012 |
| Authors: Debashree Nayak, Sanjeev Kumar Malla, Debashree Debadarshini |
10.5120/4687-6816
|
Debashree Nayak, Sanjeev Kumar Malla, Debashree Debadarshini . Improved Round Robin Scheduling using Dynamic Time Quantum. International Journal of Computer Applications. 38, 5 ( January 2012), 34-38. DOI=10.5120/4687-6816
Abstract
Round Robin scheduling algorithm is the widely used scheduling algorithm in multitasking and real time environment. It is the most popular algorithm due to its fairness and starvation free nature towards the processes, which is achieved by using the time quantum. As the time quantum is static, it causes less context switching incase of high time quantum and high context switching incase of less time quantum. Increasing context switch leads to high avg. waiting time, high avg. turnaround time which is a overhead and degrades the system performance. So, the performance of the system solely depends upon the choice of optimal time quantum which is dynamic in nature. In this paper, we have proposed a new variant of RR scheduling algorithm known as Improved Round Robin (IRR) Scheduling algorithm, by arranging the processes according to their shortest burst time and assigning each of them with an optimal time quantum which is able to reduce all the above said disadvantages. Experimentally we have shown that our proposed algorithm performs better than the RR algorithm, by reducing context switching, average waiting and average turnaround time.
References
- H.S.Behera, R.Mohanty, 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.
- Rami J. Matarneh.“Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of Now Running Processes”, American J. of Applied Sciences 6(10): 1831-1837,2009.
- Abbas Noon, Ali Kalakech, 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, May 2011 ISSN (Online): 1694-0814.
- Rakesh MohantyManas Das, M. Lakshmi Prasanna, Sudhashree “Design and Performance Evaluation of A New Proposed Fittest Job First Dynamic Round Robin (FJFDRR) Scheduling Algorithm” International Journal of Computer Information Systems, Vol. 2, No. 2, 2011.
- Ajit Singh, Priyanka Goyal, Sahil Batra.” An Optimized Round Robin Scheduling Algorithm for CPU Scheduling” International Journal on Computer Science and Engineering Vol. 02, No. 07, 2010, 2383-2385.
- Rakesh Kumar Yadav, Abhishek K Mishra, Navin Prakash and Himanshu Sharma “An Improved Round Robin Scheduling Algorithm for CPU scheduling” (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 04, 2010, 1064-1066.
- Saroj Hiranwal and 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-December 2011, pp. 319-323.
- Operating Systems ,3rd Ed., H.M.Deitel, P.J.Deitel, D.R.Choffnes .ISBN 978-81-317-1289-4.
- Operating System Concepts ,8th Ed.,Abraham Silberschatz, Peter B. Galvin, Grege Gagne . ISBN 978-81-265-2051-0.
Index Terms
Keywords