Designing of 2-Stage CPU Scheduler Using Vague Logic

Algorithm 1

𝑆𝑡𝑒𝑝  1. For process 𝑖:= 1,…,𝑁 loop

    (i) Assign 𝐵:= burst time;

      𝐴:= arrival time;

      𝑃:= static Priority;

    (ii) Compute the dynamic priority 𝑃_𝐷𝑖 using VIS.

    End loop

𝑆𝑡𝑒𝑝  2. For process 𝑖:= 1,…,𝑁 loop

    RQ:= Sort the processes in decreasing order of 𝑃_𝐷𝑖

 End loop

𝑆𝑡𝑒𝑝  3. For process 𝑖:= 1,…,𝑁 loop

    (i) Schedule and dispatch process 𝑖  ∈RQ with CPU.

    (ii) Calculate waiting time, turnaround time and normalized turnaround time for process 𝑖.

    (iii) After completion of each process 𝑖, check the RQ. If any new process arrives in the

      ready queue then go to Step 1.

  End loop

𝑆𝑡𝑒𝑝  4. Calculate average waiting time (Ws), average turnaround time (Ts) and average

   normalized turnaround time (NTs) using (8), (10) and (11) respectively.