Fair and efficient CPU scheduling algorithms.

An operating system is software that is designed to manage computer hardware and software resources. However, this management requires applying an ample number of techniques and algorithms which are called synchronization and scheduling. The scheduling algorithms are used to arrange the way that the CPU is assigned to the processes, while synchronization is utilized to indicate how to work with multi-processes at the same time. Therefore, they are related to each other. CPU scheduling is a vital phenomenon of an operating system. At present, numerous CPU scheduling algorithms exist as First Come First Serve) FCFS(, Shortest Job First (SJF), Shortest Remaining Time First (SRTF), Priority Scheduling, and Round Robin (RR). In this paper, a survey of the current synchronization and scheduling algorithms have been presented. An overview of each technique with the main algorithms have been described in detail with the advantages and the issues of each algorithm. Furthermore, this paper has dug deep into the real-time operating system scheduling issues, which is the current trend in operating system researches.

Download Full-text

Priority based round robin (PBRR) CPU scheduling algorithm

International Journal of Electrical and Computer Engineering (IJECE) ◽

10.11591/ijece.v9i1.pp190-202 ◽

2019 ◽

Vol 9 (1) ◽

pp. 190

Author(s):

Sonia Zouaoui ◽

Lotfi Boussaid ◽

Abdellatif Mtibaa

Keyword(s):

Operating System ◽

Real Time ◽

Waiting Time ◽

Scheduling Algorithm ◽

Scheduling Algorithms ◽

Turnaround Time ◽

Round Robin ◽

New Approach ◽

Real Time Operating System ◽

Cpu Scheduling

<p>This paper introduce a new approach for scheduling algorithms which aim to improve real time operating system CPU performance. This new approach of CPU Scheduling algorithm is based on the combination of round-robin (RR) and Priority based (PB) scheduling algorithms. This solution maintains the advantage of simple round robin scheduling algorithm, which is reducing starvation and integrates the advantage of priority scheduling. The proposed algorithm implements the concept of time quantum and assigning as well priority index to the processes. Existing round robin CPU scheduling algorithm cannot be dedicated to real time operating system due to their large waiting time, large response time, large turnaround time and less throughput. This new algorithm improves all the drawbacks of round robin CPU scheduling algorithm. In addition, this paper presents analysis comparing proposed algorithm with existing round robin scheduling algorithm focusing on average waiting time and average turnaround time.</p>

Download Full-text

Comparative analysis of the essential CPU scheduling algorithms

Bulletin of Electrical Engineering and Informatics ◽

10.11591/eei.v10i5.2812 ◽

2021 ◽

Vol 10 (5) ◽

pp. 2742-2750

Author(s):

Hoger K. Omar ◽

Kamal H. Jihad ◽

Shalau F. Hussein

Keyword(s):

Comparative Analysis ◽

Operating Systems ◽

Waiting Times ◽

Stable State ◽

Scheduling Algorithms ◽

High Rate ◽

Cpu Scheduling ◽

Significant Function ◽

Cpu Utilization ◽

Maximum Utilization

CPU scheduling algorithms have a significant function in multiprogramming operating systems. When the CPU scheduling is effective a high rate of computation could be done correctly and also the system will maintain in a stable state. As well as, CPU scheduling algorithms are the main service in the operating systems that fulfill the maximum utilization of the CPU. This paper aims to compare the characteristics of the CPU scheduling algorithms towards which one is the best algorithm for gaining a higher CPU utilization. The comparison has been done between ten scheduling algorithms with presenting different parameters, such as performance, algorithm’s complexity, algorithm’s problem, average waiting times, algorithm’s advantages-disadvantages, allocation way, etc. The main purpose of the article is to analyze the CPU scheduler in such a way that suits the scheduling goals. However, knowing the algorithm type which is most suitable for a particular situation by showing its full properties.

Download Full-text