© Thomas Kunz 2000
SCE 574
182
Scheduling Methods
äExamples
of scheduling methods
äPreemptive
äWilling
to context switch out current job if a higher priority job is ready to run (vs.
non-preemptive)
äRound
robin
äDefine
a time quantum, say x milliseconds
äPreempt
the current process every time quantum
äRun
the next ready to run process
äPriority
äAssign
priorities to processes
äRun
process with the highest priority
äShortest
job first
äIf you know how long programs will take to run, you can use
this information to maximize throughput
äRun
the shortest job first!
äShortest
job first also gives the minimum average response time (this can be proven)