 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| ä |
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
|
|
