Determining Proficient Time Quantum to Improve the Performance of Round Robin Scheduling Algorithm

Abstract

Process scheduling is considered as a momentous and instinct task accomplished by operating system. Round robin is one of the extensively utilized algorithms for scheduling. Various noticeable scheduling algorithms based on round robin strategy have been introduced in last decade. The most sensitive issue of round robin algorithm is time quantum because it determines and controls the time of achieving resources for a process during execution. Different types of approaches are available for determining time quantum related to round robin. This paper represents a new round robin algorithm having proficient time quantum that has been determined by considering the maximum difference among differences of adjacent consecutive processes into the ready queue. The proposed methodology is an endeavor to increase the outcomes of round robin as well as system performance. The algorithm is experimentally and comparatively better than the mentioned round robin algorithms in this paper. From the consideration against the referred algorithms, it decreases average turn-aroundtime, average waiting-time and the number of contextswitching along with other CPU scheduling criteria.

Improved Round Robin CPU Scheduling Algorithm with Different Arrival Times Based on Dynamic Quantum

“…(1) And it is decreased according to specified conditions by the equation: 𝑄 = 𝐴𝑐𝑐𝑢𝑚𝐵𝑇/(𝐼𝑄𝑃𝑁 + 1) …………………………. (2) Where: 𝑄 : Quantum 𝐴𝑐𝑐𝑢𝑚𝐵𝑇 : Accumulated BTs 𝐼𝑄𝑃𝑁 : In queue processes number This method of adjusting the quantum prevents the algorithm from falling into execution in FCFS manner, especially in cases where many processes in front of the ready queue have relatively short BTs and a few processes with long BTs are at the tail of ready queue. The quantum adjusted to be greater than BTs of nearly 70% of the processes.…”

“…The Operating system is the software that performs and implements scheduling of processes. [2] When talking about the operating system, terminology like multitasking and multiprocessing are utilized. These terms can be used interchangeably.…”

“…The CPU scheduler is responsible for allocating resources, specifically CPU time, to all processes. [2] There are three sorts of schedulers: long-term, mid-term, and short-term. The first is a long-scheduler, which determines the process that moves from the process pool on a hard disk to Random Access Memory (RAM) (HDD) [1].…”

Cloud service analysis using round-robin algorithm for quality-of-service aware task placement for internet of things services

“…In terms of testing and comparison, the algorithm performs better than the RR techniques mentioned in this work. The comparison to the mentioned techniques, it decreases the average turn-around time, average waiting time, number of context switches, and other CPU scheduling requirements [22]. The algorithm policy employed by a CPU to schedule running tasks affects the performance of an operating system (OS).…”

Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin Scheduling

“…Dynamic time quantum scheduling is a variation of Round Robin (RR) scheduling in which each process is allocated a fixed timespan to complete execution. However, in dynamic time quantum scheduling, the time quantum is not fixed and can vary depending on the behavior of the process [5,6]. For example, if a process uses up its entire time quantum without completing, it is considered CPU-bound and is assigned a more significant time quantum in the next Round.…”