Reducing waiting and turnaround time in Round Robin scheduling algorithm

Authors

  • Ali Esmaeel Tishreen University

Keywords:

CPU Scheduling; Round Robin algorithm ;waiting time; turnaround time.

Abstract

The operating system is an intermediary between the user and the computer hardware. It provides an interface that hides from the user the complexity of dealing with hardware, and allocates the resources represented by the processor and main memory to processes in a way that improves the performance of the system.

To execute any program, it must be moved to main memory so that it becomes a process ready to be executed on the processor. In a multitasking operating system, it is allowed to run multiple jobs simultaneously. The ready processes for execution are stored in a special queue called the ready queue, where the scheduler chooses the next process to be executed. The scheduler selects process based on the scheduling algorithms. These algorithms aim to arrange the execution of processes in an optimal manner, as there are several criteria for optimizing the performance of scheduling algorithms, namely: improving CPU Utilization, reducing waiting time, reducing turnaround time, in addition to reducing the number of context switch times.

This paper provides an improvement on the performance of the round Robin scheduling algorithm, which is one of the most important scheduling algorithms. It reduces waiting time and turnaround time by suggesting a dynamic quantum rather than using a fixed quantum. The time allotted for each process is calculated by calculating the median value of the burst time values for all the processes within the ready queue.

The proposed algorithm is compared with a group of other scheduling algorithms in terms of turnaround time, waiting time and number of context switches. The results show the superiority of the proposed algorithm over the other round Robin scheduling algorithms

Downloads

Published

2023-03-15

How to Cite

1.
اسماعيل ع. Reducing waiting and turnaround time in Round Robin scheduling algorithm. Tuj-eng [Internet]. 2023Mar.15 [cited 2024May2];45(1):65-76. Available from: https://journal.tishreen.edu.sy/index.php/engscnc/article/view/12962

Issue

Vol. 45 No. 1 (2023): Tishreen University Journal of Research and Scientific Studies - Engineering Sciences Series

Section

Articles

License

Copyright (c) 2023 ttps://creativecommons.org/licenses/by-nc-sa/4.0/

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

The authors retain the copyright and grant the right to publish in the magazine for the first time with the transfer of the commercial right to Tishreen University Journal for Research and Scientific Studies - Engineering Sciences Series

 Under a CC BY- NC-SA 04 license that allows others to share the work with of the work's authorship and initial publication in this journal. Authors can use a copy of their articles in their scientific activity, and on their scientific websites, provided that the place of publication is indicted in  Tishreen University Journal for Research and Scientific Studies - Engineering Sciences Series   .  The Readers have the right to send, print and subscribe to the initial version of the article, and the title of  Tishreen University Journal for Research and Scientific Studies - Engineering Sciences Series     Publisher

journal uses a CC BY-NC-SA license which mean

You are free to:

  • Adapt — remix, transform, and build upon the material
  •  
  • The licensor cannot revoke these freedoms as long as you follow the license terms.

 

  • Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • NonCommercial — You may not use the material for commercial purposes.
  • ShareAlike — If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
  • No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.