2018
DOI: 10.14419/ijet.v7i4.5.20077
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Round Robin CPU Scheduling Algorithm based on Priority of Process

Abstract: The most important and integral part of a computer system is its operating system. Scheduling various resources is one of the most critical tasks an operating system needs to perform. Process scheduling being one of those tasks, involves various techniques that define how more than one processes can be executed simultaneously. The primary aim here is to the system more efficient and faster. The fundamental scheduling algorithms are: First Come First Serve (FCFS), Round Robin, Priority Based Scheduling, and Sho… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…And of process with low priority in not all but some cases. The overall waiting time changes on the basis of set of processes considered [9].…”
Section: Introductionmentioning
confidence: 99%
“…And of process with low priority in not all but some cases. The overall waiting time changes on the basis of set of processes considered [9].…”
Section: Introductionmentioning
confidence: 99%