Problem Set 2

Assigned: Feb. 5
Due: Feb. 12

Consider the following processes (same as problem 1).

Processes enter the system under the following schedule:
E enters at time 0.
C enters at time 10.
D enters at time 20.
B enters at time 110.
A enters at time 120.

Trace the evolution of the system under the following scheduling algorithms:

You do not have to show the memory management, just the scheduling.

Note: the length of "job" considered in these algorithm is the time of the current CPU burst, not the time for the entire job.