1. Quiz

2. FCFS Q 1: Q 2: Burst time = CPU burst time
= CPU time required to execute until termination, or I/O block
Note that this isn’t something that we necessarily know in advance
Later we’ll talk about how to predict it, but for now just assume this is an analysis after the fact
Is this a good algorithm or not?
That depends on how you measure the quality of the algorithm
More on this soon…
But we do notice the that performance varies depending on the arrival order of the jobs, which doesn’t seem good
Q 1:
Q 2:

3. Round-Robin
Note that long processes don’t have as adverse an effect here as they did in FIFO scheduling
Got rid of convoy effect — not as affected by one long job and lots of short jobs
Q 1:
Q 2:

4. SJF
Q1:
Same Example, FCFS Schedule: