BCS1333 : CPU SCHEDULING EXERCISE

Consider the following table 1. Four processes are arrived at time 0, with the length of the CPU burst given in milliseconds:

Process           Burst Time       _______ * Priority

P1                                15                                3

P2                                10                                1

P3                                3                                  3

P4                                5                                  2

*smaller priority number implies a higher priority

Table1 List of processes that are arrived at time 0

 The processes are assumed to have arrives in order P1,P2,P3,P4 all at time 0.

       I       Draw four (4) Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, Priority, and RR (quantum = 5).

    II.          What is the waiting time of each process of the scheduling algorithms in part I.?

  III.          Which of the algorithms in part II. results in the minimum average waiting time (over all processes)?