Improved time quantum length estimation for round robin scheduling algorithm using neural network

Zouaoui, Sonia; Boussaid, Lotfi; Mtibaa, Abdellatif

doi:10.52549/ijeei.v7i2.464

Cited by 3 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Modifying the time slice at the beginning of each round is another dynamic version of SRR proposed by Lipika [24], in which the time slice is calculated with respect to the residual burst times (RBT) in the successive rounds. Lipika benefited from SJF in which the processes are ordered increasingly based on their burst times (i.e., the process with the highest burst time will be at the tail of the ready queue and the process with the lowest burst time will be at the head of the queue) [25][26][27]. Adaptive80 RR is a dynamic variant of SRR proposed by Christoph and Jeonghw [6].…”

Section: Related Workmentioning

confidence: 99%

An Adjustable Variant of Round Robin Algorithm Based on Clustering Technique

Mostafa¹,

Amano²

2021

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

CPU scheduling is the basic task within any time-shared operating system. One of the main goals of the researchers interested in CPU scheduling is minimizing time cost. Comparing between CPU scheduling algorithms is subject to some scheduling criteria (e.g., turnaround time, waiting time and number of context switches (NCS)). Scheduling policy is divided into preemptive and non-preemptive. Round Robin (RR) algorithm is the most common preemptive scheduling algorithm used in the time-shared operating systems. In this paper, the authors proposed a modified version of the RR algorithm, called dynamic time slice (DTS), to combine the advantageous of the low scheduling overhead of the RR and favor short process for the sake of minimizing time cost. Each process has a weight proportional to the weights of all processes. The process's weight determines its time slice within the current period. The authors benefit from the clustering technique in grouping the processes that are similar in their attributes (e.g., CPU service time, weight, allowed time slice (ATS), proportional burst time (PBT) and NCS). Each process in a cluster is assigned the average of the processes' time slices in this cluster. A comparative study of six popular scheduling algorithms and the proposed approach on nine groups of processes vary in their attributes was performed and the evaluation was measured in terms of waiting and turnaround times, and NCS. The experiments showed that the proposed algorithm gives better results.

show abstract

Section: Related Workmentioning

confidence: 99%

An Adjustable Variant of Round Robin Algorithm Based on Clustering Technique

Mostafa¹,

Amano²

2021

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

show abstract

Orr

Gupta‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬

Mathur

González

et al. 2021

Proceedings of the International Conference on Data Science, Machine Learning and Artificial Intelligence

View full text Add to dashboard Cite

A Survey of Variants of Round Robin Cpu Scheduling Algorithms

Olofintuyi¹,

Omotehinwa²,

Owotogbe³

2021

FJS

View full text Add to dashboard Cite

Quite a number of scheduling algorithms have been implemented in the past, including First Come First Served (FCFS), Shortest Job First (SJF), Priority and Round Robin (RR). However, RR seems better than others because of its impartiality during the usage of its quantum time. Despite this, there is a big challenge with respect to the quantum time to use. This is because when the quantum time is too large, it leads to FCFS, and if the quantum time is too short, it increases the number of switches from the processes. As a result of this, this paper provides a descriptive review of various algorithms that have been implemented in the past 10 years, for various quantum time in order to optimize the performance of CPU utilization. This attempt will open more research areas for researchers, serve as a reference source and articulate various algorithms that have been used in the previous years – and as such, the paper will serve as a guide for future work. This research work further suggests novel hybridization and ensemble of two or more techniques so as to improve CPU performance by decreasing the number of context switch, turnaround time, waiting time and response time and in overall increasing the throughput and CPU utilization.

show abstract

Improved time quantum length estimation for round robin scheduling algorithm using neural network

Cited by 3 publications

References 11 publications

An Adjustable Variant of Round Robin Algorithm Based on Clustering Technique

An Adjustable Variant of Round Robin Algorithm Based on Clustering Technique

Orr

A Survey of Variants of Round Robin Cpu Scheduling Algorithms

Contact Info

Product

Resources

About