Preemptive SJF
•Also called Shortest Remaining Time First –Schedule the job with the shortest remaining time required to complete •Requirement: again, the duration needs to be known in advance
Preemptive SJF: Same Example
A Problem with SJF
•Starvation –In some condition, a job is waiting forever –Example: •Process A with duration of 1 hour, arrives at time 0 •But every 1 minute, a short process with duration of 2 minutes arrive •Result of SJF: A never gets to run