Scheduling Algorithms
First-come First-served (FCFC) (FIFO)
- jobs are scheduled in order of arrival to ready Q
- typically non-preemptive
Problem:
- average waiting time can be large if small jobs wait behind long ones
-
-
-
-
- may lead to poor overlap of I/O and CPU