Priority based round robin (PBRR) CPU scheduling algorithm

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 adva...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of electrical and computer engineering (Malacca, Malacca) Jg. 9; H. 1; S. 190
Hauptverfasser: Zouaoui, Sonia, Boussaid, Lotfi, Mtibaa, Abdellatif
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Yogyakarta IAES Institute of Advanced Engineering and Science 01.02.2019
Schlagworte:
Algorithms
Central processing units
CPUs
Design of experiments
Hardware reviews
Priority scheduling
Real time
Response time (computers)
ISSN:2088-8708, 2088-8708
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2088-8708
2088-8708
DOI:10.11591/ijece.v9i1.pp190-202