PROCESS SCHEDULING

Experiment Number 2 : Shortest Job First

Algorithm

• Step 1: Sort all the processes according to the arrival time.

• Step 2: Then select that process that has minimum arrival time and minimum Burst time.

• Step 3: After completion of the process make a pool of processes that arrives afterward till the completion of the previous process and select that process among the pool which is having minimum Burst time.