The week's pick
Random Articles
Reseach Article
Two Queue based Round Robin Scheduling Algorithm for CPU Scheduling
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 105 - Number 5 |
| Year of Publication: 2014 |
| Authors: Srishty Jindal, Priyanka Grover |
10.5120/18374-9534
|
Srishty Jindal, Priyanka Grover . Two Queue based Round Robin Scheduling Algorithm for CPU Scheduling. International Journal of Computer Applications. 105, 5 ( November 2014), 21-24. DOI=10.5120/18374-9534
Abstract
Multitasking and multiuser operating system's performance depends on the efficiency of scheduling algorithm. Most commonly used Round Robin scheduling algorithm may not give optimal result if the burst time of processes is very high as compared to the time quantum of Round Robin algorithm. In this case, context switching and turnaround time of processes is very high. In this paper, a two queue based Round Robin Scheduling Algorithm is proposed. In the proposed approach two queues are used. One queue is exclusively used for CPU intensive processes and other queue is used for I/O intensive processes. This reduces the waiting time and turnaround time when there are less or equal numbers of I/O intensive processes. Performance Analysis depending upon CPU intensive and I/O intensive processes shows that it provides better results.
References
- Kantabutra Sanpawat, Kornpitak Parinya, and Naramittakapong Chengchai; "Dynamic Clustering based Round Robin Scheduling Algorithm":The Theory of Computation Group, Department of Computer Science Chiang Mai University Chiang Mai,2003.
- Bradley P. S. ,Fayyad U. M. , "Refining initial points for K-means clustering": Proc. Of 15th international conference on Machine Learning(ICML 98),pp 91-99,1998.
- Roehl Richard, Johnson Brian;"Designing a fairer Round robin Algorithm":31st Annual International Conference of The Computer Measurement Group, Inc. , Orlando Florida USA, pp 1-8,2005.
- Silberschatz A. and Galvin P. B. ; Operating System Concepts:Addison Wisley Publishing Company, New York, 1994.
- Andrew S. Tanenbaum. Modern Operating System. Prentice Hall, New Jersey,1992.
- E. G. Coffman and L. Kleinrock. Feedback queuing models for time-shared systems. Journals of the ACM, vol. 15,549-576, October 1968.
- H. S. Beher and Brajendra Kumar Swain; "A New Prposed Precedence based Round Robin with Dynamic time Quantum Scheduling Algorithm for Soft Real Time Systems"; International Journal of Advanced Research in Computer Science and Software Engineering, Vol 2, Issue 6, June 2012.
- Aashna Bisht, Mohd. Abdul Ahad and Sielvic Sharma; "Calculating Dynamic Time Quantum for Round Robin process Scheduling Algorithm", International Journal of Computer Application, Vol 98, November 21, 2014.
- Ms. Rashmi A. Dhumal, Ms. Tabassum A. Maktum, and Ms. Lata Ragha; " Dynamic Quantum based Genetic Round Robin Algorithm", International Journal of Advanced Research in Computer and Commnication Engineering, Vol 3, Issue 3, March 2014.
Index Terms
Keywords