2019
DOI: 10.11591/ijece.v9i1.pp190-202
|View full text |Cite
|
Sign up to set email alerts
|

Priority based round robin (PBRR) CPU scheduling algorithm

Abstract: <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 assignin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
16
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(16 citation statements)
references
References 12 publications
0
16
0
Order By: Relevance
“…The proposed work can provide a solution to handle this critical situation. This work mainly focuses on fuzzy rulebased approach [49][50][51][52][53] that uses priority-based method [54,55] to manage and assign the hospital beds for the treatment of COVID-19 infected patients. The proposed approach is compared with the FCFS-based [56,57] approach to analyze the practical scenario during the assignment of hospital beds.…”
Section: Proposed Methodologymentioning
confidence: 99%
“…The proposed work can provide a solution to handle this critical situation. This work mainly focuses on fuzzy rulebased approach [49][50][51][52][53] that uses priority-based method [54,55] to manage and assign the hospital beds for the treatment of COVID-19 infected patients. The proposed approach is compared with the FCFS-based [56,57] approach to analyze the practical scenario during the assignment of hospital beds.…”
Section: Proposed Methodologymentioning
confidence: 99%
“…It means that GPOSs must support multi-tasking [8], [14]. On the other hand, task scheduling and allocation are performed without priority levels of the tasks in GPOSs [15]. It is possible to execute lower priority tasks  ISSN: 2088-8708 Int J Elec & Comp Eng, Vol.…”
Section: Introductionmentioning
confidence: 99%
“…Processes in the computer system have dissimilar forms for example "dis-joint process, co-operating process, and interacting processes". Figure 1 presents the process lifecycle [4].…”
Section: Introductionmentioning
confidence: 99%
“…Figure 1. Process lifecycle [4] The long term determines which tasks or processes are to be accepted to get the ready queue so when establishing an attempt for process execution, its admission to the band of executing processes currently which is either authorized or stayed (delay) through the long-term scheduler. Hence, this scheduler orders which processes are to run on a system and the concurrency level should be backed at any time.…”
Section: Introductionmentioning
confidence: 99%