Traditional Round Robin CPU Scheduling Algorithm to Prioritize Processes with Residual Burst time Nearest to the Specified time Quantum: An Advanced Approach

2022 ◽  
pp. 1-11
Author(s):  
Mythili Boopathi ◽  
Pranav Korde ◽  
Pallav Dey
Keyword(s):  
Scheduling Algorithm ◽  
Round Robin ◽  
Cpu Scheduling ◽  
Time Quantum ◽  
Burst Time

scholarly journals Optimal Round Robin CPU Scheduling Algorithm Using Manhattan Distance

2017 ◽  
Vol 7 (6) ◽  
pp. 3664 ◽  
Author(s):  
N. Srilatha ◽  
M. Sravani ◽  
Y. Divya
Keyword(s):  
Waiting Time ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Manhattan Distance ◽  
Cpu Scheduling ◽  
Cpu Time ◽  
Interactive Environment ◽  
Time Quantum ◽  
Burst Time ◽  
Better Than

In Round Robin Scheduling the time quantum is fixed and then processes are scheduled such that no process get CPU time more than one time quantum in one go. The performance of Round robin CPU scheduling algorithm is entirely dependent on the time quantum selected. If time quantum is too large, the response time of the processes is too much which may not be tolerated in interactive environment. If time quantum is too small, it causes unnecessarily frequent context switch leading to more overheads resulting in less throughput. In this paper a method using Manhattan distance has been proposed that decides a quantum value. The computation of the time quantum value is done by the distance or difference between the highest burst time and lowest burst time. The experimental analysis also shows that this algorithm performs better than RR algorithm and by reducing number of context switches, reducing average waiting time and also the average turna round time.

scholarly journals Round Robin Scheduling Algorithm based on Dynamic time quantum

2019 ◽  
Vol 8 (6) ◽  
pp. 593-595
Keyword(s):  
Operating System ◽  
Waiting Time ◽  
Optimal Algorithm ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Cpu Scheduling ◽  
Time Quantum ◽  
Turn Around Time ◽  
Dynamic Time ◽  
Burst Time

After studying various CPU scheduling algorithms in Operating System, Round Robin scheduling algorithm is found to be most optimal algorithm in timeshared systems because of the static time quantum that is designated for every process. The efficacy of Round Robin algorithm entirely depends on the static time quantum that is being selected. After studying and analyzing Round Robin algorithm, I have proposed a new modified Round Robin algorithm that is based on shortest remaining burst time which has resulted in dynamic time quantum in place of static time quantum. This improves the performance of existing algorithm by reducing average waiting time and turn-around time and minimizing the number of context switches.

scholarly journals Dynamic Time Quantum based Round Robin CPU Scheduling Algorithm

2017 ◽  
Vol 167 (13) ◽  
pp. 48-55 ◽  
Author(s):  
Yosef Berhanu ◽  
Abebe Alemu ◽  
Manish Kumar
Keyword(s):  
Scheduling Algorithm ◽  
Round Robin ◽  
Cpu Scheduling ◽  
Time Quantum ◽  
Dynamic Time

scholarly journals Comparison Analysis of CPU Scheduling FCFS, SJF and Round Robin

2017 ◽  
Author(s):  
Andysah Putera Utama Siahaan
Keyword(s):  
Task Scheduling ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
The Other ◽  
Comparison Analysis ◽  
Cpu Scheduling ◽  
Multiple Processes ◽  
Burst Time ◽  
Better Than

Task scheduling is needed to maintain every process that comes with a processor in parallel processing. In several conditions, not every algorithm works better on the significant problem. Sometimes FCFS algorithm is better than the other in short burst time while Round Robin is better for multiple processes in every single time. However, it cannot be predicted what process will come after. Average Waiting Time is a standard measure for giving credit to the scheduling algorithm. Several techniques have been applied to maintain the process to make the CPU performance in normal. The objective of this paper is to compare three algorithms, FCFS, SJF, and Round Robin. The target is to know which algorithm is more suitable for the certain process.

scholarly journals A Novel Amended Dynamic Round Robin Scheduling Algorithm for Timeshared Systems

2019 ◽  
Vol 17 (1) ◽  
pp. 90-98 ◽  
Author(s):  
Uferah Shafi ◽  
Munam Shah ◽  
Abdul Wahid ◽  
Kamran Abbasi ◽  
Qaisar Javaid ◽  
...  
Keyword(s):  
Operating System ◽  
Scheduling Algorithm ◽  
Turnaround Time ◽  
Round Robin ◽  
Processing Unit ◽  
Cpu Scheduling ◽  
Central Processing ◽  
Quantum Time ◽  
Simulation Results ◽  
Burst Time

Central Processing Unit (CPU) is the most significant resource and its scheduling is one of the main functions of an operating system. In timeshared systems, Round Robin (RR) is most widely used scheduling algorithm. The efficiency of RR algorithm is influenced by the quantum time, if quantum is small, there will be overheads of more context switches and if quantum time is large, then given algorithm will perform as First Come First Served (FCFS) in which there is more risk of starvation. In this paper, a new CPU scheduling algorithm is proposed named as Amended Dynamic Round Robin (ADRR) based on CPU burst time. The primary goal of ADRR is to improve the conventional RR scheduling algorithm using the active quantum time notion. Quantum time is cyclically adjusted based on CPU burst time. We evaluate and compare the performance of our proposed ADRR algorithm based on certain parameters such as, waiting time, turnaround time etc. and compare the performance of our proposed algorithm. Our numerical analysis and simulation results in MATLAB reveals that ADRR outperforms other well-known algorithms such as conventional Round Robin, Improved Round Robin (IRR), Optimum Multilevel Dynamic Round Robin (OMDRR) and Priority Based Round Robin (PRR)

Sign in / Sign up

Export Citation Format

Share Document