Statistical Approach to Determine Most Efficient Value for Time Quantum in Round Robin Scheduling

Gowda, Shreyank N

doi:10.5121/ijcsit.2016.8404

Cited by 1 publication

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the field of operating systems dynamic time quantum selection is an active area of research to improve the performance of system. Some researchers have already proposed a modified version of Round Robin, in which dynamic time quantum is continuously computed for currently running jobs based on burst times of currently running jobs [5]. However, existing algorithms are still not efficient enough in reducing the number of context switches (CS), average waiting time (AWT), and average turnaround time (ATT).…”

Section: Dynamicmentioning

confidence: 99%

“…In this section, we review some existing modified Round Robin Scheduling algorithms that have been proposed till now for enhancing the performance of the classical RR algorithm by computing dynamic time quantum. In [5], Gowda proposes a statistical approach for dynamic time quantum. They divide jobs into four categories based on burst time and time quantum.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Time Quantum Computation for Improved Round Robin Scheduling Algorithm Using Quartiles and Randomization (IRRQR)

Jamil,

Yar,

Ijaz

2024

SJCMS

View full text Add to dashboard Cite

Scheduling is a decision-making process through which large numbers of tasks compete for various system resources. The availability of limited resources makes scheduling a challenge. Among resources, the processor is the most important resource for in-time completion of tasks therefore; developing an efficient processor scheduler is still a topic of interest. In this paper, we have proposed a modified Round Robin scheduling algorithm, in which the dynamic time quantum is computed based on Quartiles and randomness. We have considered average waiting time, average turnaround time, and the number of context switches as performance metrics and compared the proposed scheduling algorithm with existing approaches. The results show that the average waiting time, average turnaround time, and the number of context switches using the proposed algorithm are significantly reduced as compared other algorithms.

show abstract

Section: Dynamicmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%