Research Article
A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 5 - Issue 5 |
| Published: August 2010 |
| Authors: Debashree Nayak, R. Mohanty, H.S.Behera |
10.5120/913-1291
|
Debashree Nayak, R. Mohanty, H.S.Behera . A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis. International Journal of Computer Applications. 5, 5 (August 2010), 10-15. DOI=10.5120/913-1291
@article{ 10.5120/913-1291,
author = { Debashree Nayak,R. Mohanty,H.S.Behera },
title = { A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis },
journal = { International Journal of Computer Applications },
year = { 2010 },
volume = { 5 },
number = { 5 },
pages = { 10-15 },
doi = { 10.5120/913-1291 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2010
%A Debashree Nayak
%A R. Mohanty
%A H.S.Behera
%T A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis%T
%J International Journal of Computer Applications
%V 5
%N 5
%P 10-15
%R 10.5120/913-1291
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Scheduling is the central concept used frequently in Operating System. It helps in choosing the processes for execution. Round Robin (RR) is one of the most widely used CPU scheduling algorithm. But, its performance degrades with respect to context switching, which is an overhead and it occurs during each scheduling. Overall performance of the system depends on choice of an optimal time quantum, so that context switching can be reduced. In this paper, we have proposed a new variant of RR scheduling algorithm, known as Dynamic Quantum with Re-adjusted Round Robin (DQRRR) algorithm. We have experimentally shown that performance of DQRRR is better than RR by reducing number of context switching, average waiting time and average turnaround time.
References
- 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.
- Sunita Mohan.“Mixed Scheduling (A New Scheduling Policy)”. Proceedings of Insight’09,25-26 November 2009.
- Helmy, T. and A. Dekdouk, 2007.“Burst Round Robin as a Proportional-share Scheduling Algorithm”, . IEEEGCC,http://eprints . kfupm.edu. sa/1462/.
- Rashid, M.M. and Z.N. Akhtar,2006.“A New Multilevel CPU Scheduling Algorithm”. J.AppliedSci., 6:2036-2039.DOI: 10.3923/jas. 2006. 2036. 2039.
- Silberschatz,A.,P.B.GalvinandG.Gagne,2004.“Operating Systems Concepts”. 7th Edn.,John Wiley and Sons, USA. , ISBN:13:978-0471694663,pp:944.
- Tanebun, A.S., 2008,“Modern Operating Systems”.3rd Edn. Prentice Hall, ISBN: 13:9780136006633, pp: 1104.
- BogdanCaprita, Wong Chun Chan, Jason Nieth, Clifford Stein, and Haoqiang Zheng. “Group Ratio Round-Robin: O (1) Proportional share Scheduling for Uni-processor and Multiprocessor Systems”. In USENIX Annual Technical Conference, 2005.
- Biju K Raveendran, Sundar Bala Subramaniam, S.Gurunarayanan, “Evaluation of Priority Based Realtime Scheduling Algorithms: Choices and Tradeoffs”, SAC’08,March 16- 20,2008,copyright 2008 ACM 978-1-59593-753-7/08/003.
- C. Yaashuwanth, Dr. R. Ramesh.”A New Scheduling Algorithms for Real Time Tasks ” ,(IJCSIS)International Journal of Computer Science and Information Security,Vol.6,No.2,2009.
- Jason Nieh, Charis Vaill, Hua Zhong. “Virtual-TimeRound Robin:An O(1) ProportionalShareScheduler”, Proceedings of the 2001 USENIX Annual Technical Conference,June 2001.
Index Terms
Keywords