time it takes for the dispatcher to stop one process and start another running

time required for a particular process to complete, from submission time to completion

Exit time - Arrival time

Turnaround time - Burst time

start time - arrival time

every process in a computer system requires some amount of time for its execution. This time is
both the CPU time and the I/O time

FCFS is optimal average waiting time

FCFS scheduling is a nonpreemptive algorithm

Convoy effect leads to

Associate with each process the length of its next CPU burst

is used to break a tie if the next CPU bursts of two processes are the same

SJF is optimal — gives minimum average waiting time for a given set of processes

Can be done by using the length of previous CPU bursts, using exponential averaging

Shortest-remaining-time-first is nonpreemptive

τ(n+1)