scholarly journals Enhanced Precedence Scheduling Algorithm with Dynamic Time Quantum (EPSADTQ)

2015 ◽  
Vol 10 (8) ◽  
pp. 938-941 ◽  
Author(s):  
G. Siva Nageswara Rao ◽  
S.V.N. Srinivasu ◽  
N. Srinivasu ◽  
G. Ramakoteswara Rao
Keyword(s):  
Scheduling Algorithm ◽  
Time Quantum ◽  
Dynamic Time

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 Time Efficient Round Robin Job Scheduling (NARR) in Cloud Computing

2019 ◽  
Vol 9 (1) ◽  
pp. 6912-6917
Keyword(s):  
Cloud Computing ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Quantum Time ◽  
Time Quantum ◽  
Computational Aspects ◽  
The Common ◽  
Dynamic Time ◽  
Number Of Customers

Cloud computing simply means the advancement of distributed computing which takes data processing computational aspects over networks to centralized high-power data centers. It refers to the use of a centralized pool of resources that are distributed on a pay-per-view model to a large number of customers. This requires scheduling algorithms that allow us to define which task processes, among which resources are first allocated for performance. The Round Robin (RR) scheduling algorithm is the common scheduling algorithm used in multitasking and real-time environments. Its performance is largely determined by the amount of time it takes to carry out a specific task assigned by the CPU. If the less time is chosen the context switch is high and the higher time is chosen, the first-come first-server (FCFS) is selected. System's performance thus totally depends on the optimal quantum time to choose from. In this paper, I'm examining a different way of improving the performance of the round robin scheduling algorithm by means of a dynamic time quantum and comparison of different performance.

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.

Sign in / Sign up

Export Citation Format

Share Document