Open AccessPriority based round robin (PBRR) CPU scheduling algorithm
Author(s) -
Sonia Zouaoui,
Lotfi Boussaid,
abdellatif mtibaa
Publication year - 2019
Publication title -
international journal of electrical and computer engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.277
H-Index - 22
ISSN - 2088-8708
DOI - 10.11591/ijece.v9i1.pp190-202
Subject(s) - computer science , round robin scheduling , fair share scheduling , rate monotonic scheduling , earliest deadline first scheduling , dynamic priority scheduling , turnaround time , two level scheduling , algorithm , scheduling (production processes) , fixed priority pre emptive scheduling , parallel computing , distributed computing , operating system , mathematical optimization , mathematics , schedule
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.