Priority based Round Robin CPU Scheduling using Dynamic Time Quantum
Abstract
approach for round robin CPU scheduling algorithm which
improves the performance of CPU. In proposed algorithm processes
are scheduled for execution according to the priority by calculating
the time quantum dynamically instead of using fixed time quantum.
In proposed algorithm waiting time of highest priority process
reduced because giving first preference to highest priority process
(highest to lowest) and the number of context switches are reduced
by using ‘ Dynamic Time Quantum ‘. It also looks into decreasing
the average waiting time of the processes.
Full Text:
PDFReferences
Silberschatz Abraham,Peter B. Galvin, Greg Gagne, Operating System
Concepts, Addison Wesely,7th Edition, 2006.
Ishwari Singh Rajput,Deepa Gupta, A priority based Round Robin CPU
scheduling algorithm for Real Time System
William Stallings, Operating Systems Internal and Design Principles, 5th
Edition , 2006
Ajit Singh, Priyanka Goyal, Sahil Batra,” An Optimized Round Robin
Scheduling Algorithm for CPU Scheduling”, (IJCSE) International Journal on
Computer Science and Engineering Vol. 02, No. 07, 2383-2385, 2010.
Rakesh kumar yadav, Abhishek K Mishra, Navin Prakash, Himanshu
Sharma,” An Improved Round Robin Scheduling Algorithm for CPU
Scheduling”, (IJCSE) International Journal on Computer Science and
Engineering Vol. 02, No. 04, 1064-1066, 2010.
Abbas Noon, Ali Kalakech, Seifedine Kadry, “A New Round Robin Based
Scheduling Algorithm for Operating Systems: Dynamic Quantum
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
William Stallings, Operating Systems Internal and Design Principles, 5th
Edition , 2006.
Refbacks
- There are currently no refbacks.
Copyright © IJETT, International Journal on Emerging Trends in Technology