scholarly journals An Optimum Time Quantum Using Linguistic Synthesis for Round Robin Cpu Scheduling Algorithm

2012 ◽  
Vol 3 (1) ◽  
pp. 57-66 ◽  
Author(s):  
Supriya Raheja
Keyword(s):  
Scheduling Algorithm ◽  
Round Robin ◽  
Optimum Time ◽  
Cpu Scheduling ◽  
Time Quantum ◽  
Linguistic Synthesis

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 Designing of Vague Logic Based 2-Layered Framework for CPU Scheduler

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Supriya Raheja
Keyword(s):  
Simulation Analysis ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Optimum Time ◽  
Optimum Length ◽  
Learning Capability ◽  
Inference System ◽  
Time Quantum ◽  
Overall Performance ◽  
Effectiveness And Efficiency

Fuzzy based CPU scheduler has become of great interest by operating system because of its ability to handle imprecise information associated with task. This paper introduces an extension to the fuzzy based round robin scheduler to a Vague Logic Based Round Robin (VBRR) scheduler. VBRR scheduler works on 2-layered framework. At the first layer, scheduler has a vague inference system which has the ability to handle the impreciseness of task using vague logic. At the second layer, Vague Logic Based Round Robin (VBRR) scheduling algorithm works to schedule the tasks. VBRR scheduler has the learning capability based on which scheduler adapts intelligently an optimum length for time quantum. An optimum time quantum reduces the overhead on scheduler by reducing the unnecessary context switches which lead to improve the overall performance of system. The work is simulated using MATLAB and compared with the conventional round robin scheduler and the other two fuzzy based approaches to CPU scheduler. Given simulation analysis and results prove the effectiveness and efficiency of VBRR scheduler.

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.

Sign in / Sign up

Export Citation Format

Share Document