© Thomas Kunz 2000
SCE 574
181
   Process Scheduling
äCriteria for scheduling
äFairness: make sure each process gets its fair share of the CPU
äEfficiency: keep the CPU busy 100% of the time
äResponse time: minimize response times for interactive users
äTurnaround: minimize the time batch users must wait for output
äThroughput: maximize the number of jobs processed per hour
äNotes:
äAny scheduling algorithm will favor some class of processes over others
äNeed to find a balance of interests for each specific environment
äMaximize throughput
äMinimize response times
äSome combination of the two