1
Q
what is response time
A
the time from when a job enters the scheduler queue to the time its execution is complete
2
Q
what is throughput?
A
the number of jobs that are fully executed in a given period of time (aka minimum schedule length)
3
Q
what heuristic can be gained from the shortest job first algorithm
A
this algorithm produces the schedule with the minimum mean average response time
4
Q
what heuristic can be gained from longest job first
A
this algorithm produces the schedule that has very close (although does not guarantee) to the maximum throughput
