CS 3733 Operating Systems, Spring 2002 Class Assignment from September 17

Consider two processes, each with two CPU bursts with one I/O burst in between.

P1: CPU burst of 8 units, I/O burst of 7 units, CPU burst of 3 units.

P2: CPU burst of 6 units, an I/O burst of 3 units and a CPU burst of 2 units.

Suppose that Process 1 arrives in the ready queue just before Process 2 and just after Process 2 arrives the process that was in the CPU terminates. No other processes are in the system. For each of the scheduling algorithms below draw a Gantt charts showing the state of each of the two processes and calculate the waiting times and CPU utilization.

  1. FCFS
  2. SJF (non-preemptive)
  3. preemptive SJF
  4. Round Robin, quantum 3
Here is a solution.