2017
DOI: 10.1007/978-981-10-5508-9_3
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of Smart Job First Dynamic Round Robin (SJFDRR) Scheduling Algorithm with Smart Time Quantum in Multi-core Processing System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 1 publication
0
2
0
Order By: Relevance
“…Besides RR, several common scheduling algorithms in computer system are first come first served (FCFS), shortest job first (SJF), priority scheduling [30] and shortest remaining time (SRT) [31,32]. In the SJF, job which has minimum CPU time will be prioritized [30] so that SJF is similar with shortest processing time (SPT). Meanwhile, SRT is the preemptive derivative of the SJF [30].…”
Section: Scheduling Algorithm In Computer Systemmentioning
confidence: 99%
See 1 more Smart Citation
“…Besides RR, several common scheduling algorithms in computer system are first come first served (FCFS), shortest job first (SJF), priority scheduling [30] and shortest remaining time (SRT) [31,32]. In the SJF, job which has minimum CPU time will be prioritized [30] so that SJF is similar with shortest processing time (SPT). Meanwhile, SRT is the preemptive derivative of the SJF [30].…”
Section: Scheduling Algorithm In Computer Systemmentioning
confidence: 99%
“…In the SJF, job which has minimum CPU time will be prioritized [30] so that SJF is similar with shortest processing time (SPT). Meanwhile, SRT is the preemptive derivative of the SJF [30].…”
Section: Scheduling Algorithm In Computer Systemmentioning
confidence: 99%