Problem Set 2

Assigned: Jan. 29
Due: Feb. 5

Consider the following processes (same as problem 1).

Processes enter the system under the following schedule:
D enters at time 0.
E enters at time 1.
B enters at time 2.
A enters at time 5.
C enters at time 10.

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.

In any of these algorithm, if job P unblocks at the same time that job Q blocks, the scheduling algorithm should consider P as a possible candidate to replace Q. That is, you should first deal with P unblocking and then run the scheduling algorithm.