CS101

CPU Scheduling practice problem

Below is a table of jobs that we must schedule on a batch operating system. All jobs are available from the start.

Job    Arrival time    Run time
 J1        0            5 seconds
 J2        0            6 seconds
 J3        0            1 second
 J4        0            2 seconds

  1. Create a time-line to illustrate the First-Come First-Served (FCFS) strategy. It should include the start/stop times of each job.

  2. Compute the average turnaround time of the four jobs using your FCFS time-line from the previous question.

  3. Create a time-line to illustrate the Shortest Job Next (SJN) strategy. It should include the start/stop times of each job.

  4. Compute the average turnaround time of the four jobs using your SJN time-line from the previous question.

My solutions here