International Journal of Networked and Distributed Computing

Volume 8, Issue 4, October 2020, Pages 195 - 202

Improved Version of Round Robin Scheduling Algorithm Based on Analytic Model

Authors
Alaa Fiad*, Zoulikha Mekkakia Maaza, Hayat Bendoukha
Laboratoire SIMPA, Faculté des Mathématiques et d’Informatique Université des Sciences et de la Technologie d’Oran Mohamed Boudiaf, USTO-MB, BP 1505, El Mnaouer, Oran/Zone 31000, Algéria
*Corresponding author. Email: alaa.fiad@univ-usto.dz
Corresponding Author
Alaa Fiad
Received 13 May 2020, Accepted 3 July 2020, Available Online 12 August 2020.
DOI
https://doi.org/10.2991/ijndc.k.200804.001How to use a DOI?
Keywords
Task scheduling, round robin scheduling, time quantum, burst time, waiting time, turnaround time
Abstract

Scheduling is one of the most important issues in the operating system, such as the tasks must be affected to the appropriate virtual machines, considering different factors at the same time to ensure better use of resources. A lot of research has been carried out to propose more efficient task scheduling algorithms. Round robin is one of the most powerful algorithms in this field but its main challenge is the choice of time quantum. The effectiveness of Round Robin depends on the choice of this parameter. In this paper, we aimed to overcome these challenge by proposing an improved Round Robin scheduling algorithm using a variable time quantum based on an analytic model. Our analytical model takes into consideration different parameters to determine the order of tasks execution. The use of burst time as parameters in our model ensures a more suitable time quantum. This algorithm can be applied in any operating system and therefore in the cloud computing environment. In order to assess the performance and effectiveness of the proposed approach, five different scenarios have been implemented; the comparisons made with existing works have shown that the proposed approach improves the average waiting time and the average turnaround time, which ensures better scheduling of tasks and better use of resources.

Copyright
© 2020 The Authors. Published by Atlantis Press B.V.
Open Access
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)
View full text (HTML)

Journal
International Journal of Networked and Distributed Computing
Volume-Issue
8 - 4
Pages
195 - 202
Publication Date
2020/08
ISSN (Online)
2211-7946
ISSN (Print)
2211-7938
DOI
https://doi.org/10.2991/ijndc.k.200804.001How to use a DOI?
Copyright
© 2020 The Authors. Published by Atlantis Press B.V.
Open Access
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - JOUR
AU  - Alaa Fiad
AU  - Zoulikha Mekkakia Maaza
AU  - Hayat Bendoukha
PY  - 2020
DA  - 2020/08
TI  - Improved Version of Round Robin Scheduling Algorithm Based on Analytic Model
JO  - International Journal of Networked and Distributed Computing
SP  - 195
EP  - 202
VL  - 8
IS  - 4
SN  - 2211-7946
UR  - https://doi.org/10.2991/ijndc.k.200804.001
DO  - https://doi.org/10.2991/ijndc.k.200804.001
ID  - Fiad2020
ER  -