2015
DOI: 10.19026/rjaset.10.2450
|View full text |Cite
|
Sign up to set email alerts
|

Enhanced Precedence Scheduling Algorithm with Dynamic Time Quantum (EPSADTQ)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Process gets dispatched to another process based on the CPU requirement and increase order of burst time [12] [13] [14]. Two processes CPU scheduling algorithm reduce the average waiting time and average turnaround time but context switch scheduling criteria is not considered [15] [16]. Above existing survey lacks in providing optimality regarding the scheduling criteria"s in which the system performance can be improved further […”
Section: Related Workmentioning
confidence: 99%
“…Process gets dispatched to another process based on the CPU requirement and increase order of burst time [12] [13] [14]. Two processes CPU scheduling algorithm reduce the average waiting time and average turnaround time but context switch scheduling criteria is not considered [15] [16]. Above existing survey lacks in providing optimality regarding the scheduling criteria"s in which the system performance can be improved further […”
Section: Related Workmentioning
confidence: 99%