CPU Scheduling: Draw a Gantt chart for the following scheduling algorithms:

Consider the following process arrival list:

Consider the following scheduling methods:

(a) First-come first-served (FCFS) (c) Shortest remaining time first (SRTF)

(b)Shortest-job first (SJF) (d)Round-robin (RR), quantum = 5

Draw a Gantt chart (time line) showing which process is executing over time and calculate the average waiting time and average completion time.

Notes: (1) In SRTF, if a process arrives with service time equal to the remaining service time of the process currently being served, the current process is not interrupted. (2) In RR, if a process arrives at the same time a quantum finishes, the running process is preempted and the new arrival executes. The preempted process goes to the end of the ready queue. (3) Waiting timeand completion timeis defined as in the slides.

Name Arrival Time Service Time 4 13 21 4