Smart Round Robin CPU Scheduling Algorithm For Operating Systems

Mody, Samkit; Mirkar, Sulalah

doi:10.1109/iceeccot46775.2019.9114602

Cited by 7 publications

(6 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Processes having their burst times greater than the time quantum will be interrupted and moved towards the end of the ready queue while the following process in the queue gets executed. Thus, the starvation of processes is eliminated [11]. Nevertheless, the value of time quantum majorly determines the efficiency.…”

Section: Round Robin Schedulingmentioning

confidence: 99%

See 1 more Smart Citation

Queue Fundamentals, Implementation and its Applications in Round Robin Scheduling

Fernandes¹

2022

IJASE

View full text Add to dashboard Cite

Queue is an important data structure that has wide ranging applications. In this paper, we examine various operations of queues where we focus on numerous approaches to enter as well as delete elements and also display the contents of a queue. There are two major methods to implement queues, using arrays or linked lists. The benefits of these techniques are discussed along with their algorithms for the linked list implementation of queues. The major application of queues is in the scheduling of processes. Different scheduling algorithms have been designed with varying benefits. A brief overview of a few conventional algorithms is provided following which we implement two types of round robin algorithms using queues. The simple round robin algorithm makes use of a static time quantum while the smart round robin incorporates a dynamic time quantum. These algorithms are compared for different values of burst times of processes so as to show the effectiveness of smart round robin algorithm.

show abstract

Section: Round Robin Schedulingmentioning

confidence: 99%

“…Moreover, various operating system issues like context switching overhead are ignored during the calculation of various statistics. It is also necessary to understand the burst time of each process beforehand, which may not always be feasible [11].…”

Section: Round Robin Schedulingmentioning

confidence: 99%

Queue Fundamentals, Implementation and its Applications in Round Robin Scheduling

Fernandes¹

2022

IJASE

View full text Add to dashboard Cite

show abstract

“…As a result, it has an impact on its performance. [7] An operating system can choose a process and send it to the CPU for execution in many ways. Every scheduling algorithm has its own set of benefits and drawbacks [8], [9].…”

Section: Introductionmentioning

confidence: 99%

“…Context switching is typically computationally demanding, resulting in time and memory waste. The scheduler and operating system frequently incur this cost [7] [15], [14] There are many distinct CPU-scheduling algorithms, each with its own set of attributes, and selecting the right one can favor one class of activities over another. The features of the various algorithms must be examined while deciding which algorithm to utilize in a certain situation.…”

Section: Introductionmentioning

confidence: 99%

“…When comparing the regular RR with an optimized RR, their findings suggest that the turnaround is reduced by about 15%, the WT is reduced by 15%, and the context switch is reduced by around 10%. In [24], the researchers developed a novel algorithm, which consists of a number of algorithms that have been combined to create a single algorithm. The goal is to reduce the waiting time.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Ahmad

2022

JES

View full text Add to dashboard Cite

Modern operating systems are based on the principle of time-sharing in executing simultaneous operations. Determining the length of the time slice, and the times when processes arrive at the ready queue are problems that affect metrics as the average waiting time (AWT), average turnaround time (ATAT), response time (RT) and the number of context switches (NCS) of the time-sharing round robin RR algorithms. The research aims to propose an algorithm that achieves a short waiting time while maintaining a reasonable response time, which is the most important characteristic of timesharing algorithms. The Different Arrival-Dynamic Quantum Round Robin (DADQRR) algorithm bases its work on different parameters to adjust the time slice value dynamically. The algorithm has been compared to three other algorithms that are similar in terms of dealing with different arrival times, namely AN, MARR, RR. The algorithm outperformed the three algorithms at range from 6.155% to 31.409% in term of AWT. It achieved an outperformance of 5.924% to 30.850%, considering the TAT. The ranges of outperformance values resulted from the difference in the ranges of arrival times, as well as in the ranges of burst times.

show abstract