Comparative Analysis of CPU Scheduling Algorithms and Their Optimal Solutions

Reddy, M. Rajasekhar; Ganesh, V.V.D.S.S.; Lakshmi, S. Kanaga; Sireesha, Yerramreddy

doi:10.1109/iccmc.2019.8819679

Cited by 8 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…CPU scheduling is defined as allocating and de-allocating the CPU to a specific process/thread. CPU scheduling is the most important and most effective task in the performance of the operating system [1][2][3]. CPU scheduling should provide efficient and fair usage of the computing resource (i.e., CPU time).…”

Section: Cpu Schedulingmentioning

confidence: 99%

ATS: A Novel Time-Sharing CPU Scheduling Algorithm Based on Features Similarities

Mostafa¹,

Idris²,

Kaur³

2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Minimizing time cost in time-shared operating systems is considered basic and essential task, and it is the most significant goal for the researchers who interested in CPU scheduling algorithms. Waiting time, turnaround time, and number of context switches are the most time cost criteria used to compare between CPU scheduling algorithms. CPU scheduling algorithms are divided into non-preemptive and preemptive. Round Robin (RR) algorithm is the most famous as it is the basis for all the algorithms used in time-sharing. In this paper, the authors proposed a novel CPU scheduling algorithm based on RR. The proposed algorithm is called Adjustable Time Slice (ATS). It reduces the time cost by taking the advantage of the low overhead of RR algorithm. In addition, ATS favors short processes allowing them to run longer time than given to long processes. The specific characteristics of each process are; its CPU execution time, weight, time slice, and number of context switches. ATS clusters the processes in groups depending on these characteristics. The traditional RR assigns fixed time slice for each process. On the other hand, dynamic variants of RR assign time slice for each process differs from other processes. The essential difference between ATS and the other methods is that it gives a set of processes a specific time based on their similarities within the same cluster. The authors compared between ATS with five popular scheduling algorithms on nine datasets of processes. The datasets used in the comparison vary in their features. The evaluation was measured in term of time cost and the experiments showed that the proposed algorithm reduces the time cost.

show abstract

Section: Cpu Schedulingmentioning

confidence: 99%

ATS: A Novel Time-Sharing CPU Scheduling Algorithm Based on Features Similarities

Mostafa¹,

Idris²,

Kaur³

2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

show abstract

“…Allocating and de-allocating the CPU to a specific process is known as process scheduling (also known as CPU scheduling) [1][2][3]; the piece of the operating system that performs these functions is called the scheduler. From the processes that are waiting in the memory to receive service from the CPU, the scheduler chooses the next process to be assigned to the CPU.…”

Section: Cpu Schedulingmentioning

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

“…The mechanism for allocating and de-allocating the CPU to a process is known as CPU scheduling [1][2][3]; the portion of the operating system that carries out these functions is called the scheduler. In multi-programming systems, the number of processes in the memory is restricted by the degree of multi-programming.…”

Section: Cpu Schedulingmentioning

confidence: 99%

Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique

Mostafa

Amano

2020

Applied Sciences

View full text Add to dashboard Cite

Minimizing time cost in time-shared operating system is the main aim of the researchers interested in CPU scheduling. CPU scheduling is the basic job within any operating system. Scheduling criteria (e.g., waiting time, turnaround time and number of context switches (NCS)) are used to compare CPU scheduling algorithms. Round robin (RR) is the most common preemptive scheduling policy used in time-shared operating systems. In this paper, a modified version of the RR algorithm is introduced to combine the advantageous of favor short process and low scheduling overhead of RR for the sake of minimizing average waiting time, turnaround time and NCS. The proposed work starts by clustering the processes into clusters where each cluster contains processes that are similar in attributes (e.g., CPU service period, weights and number of allocations to CPU). Every process in a cluster is assigned the same time slice depending on the weight of its cluster and its CPU service period. The authors performed comparative study of the proposed approach and popular scheduling algorithms on nine groups of processes vary in their attributes. The evaluation was measured in terms of waiting time, turnaround time, and NCS. The experiments showed that the proposed approach gives better results.

show abstract

Comparative Analysis of CPU Scheduling Algorithms and Their Optimal Solutions

Cited by 8 publications

References 6 publications

ATS: A Novel Time-Sharing CPU Scheduling Algorithm Based on Features Similarities

ATS: A Novel Time-Sharing CPU Scheduling Algorithm Based on Features Similarities

An Adjustable Variant of Round Robin Algorithm Based on Clustering Technique

Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique

Contact Info

Product

Resources

About