Project 2 Scheduling Experiments Yojan Giri SCICOMP301 Topics in Computer Science 1 CPU Utilization: CPU utilization refers to a computer's usage of processing resources, or the amount of work handled by a CPU. Throughput: It refers to the number of processes completed per unit of time. 2) Criteria Turnaround time: It refers to the time taken to execute a process. It is measured from the time of submission of the process to the time of completion. Waiting time: It is time spent by a process in the ready queue before it is scheduled to be executed. 2 3) Experiment 1 : no difference in results when all distribution values are constant Contents of psconfig and run files 3 4) Experiment 1 : no difference in results when all distribution values are constant values are constant Contents the exp file 4 5) Experiment 1 : no difference in results when all distribution values are constant values are constant Box plots of the results for waiting times for RR, FCFS, SJF, and PSJF. 5 6) Experiment 1 :no difference in results when all distribution values are constant values are constant Table shows averages for four scheduling criteria for each scheduling algorithm • While all the algorithms have CPU Utilization and Throughput same (1 and 0.4 respectively), FCFS, SJF and PSJF have the lowest average turnaround time and average waiting time. • Therefore, the FCFS, SJF and PSJF are tied as winners. 6 7) Experiment 1 : no difference in results when all distribution values are constant values are constant Trend Check • The boxplots represent waiting times for different number of processes with the processes increasing as we move to the right. • The plot shows that increasing number of processes leads to increase in minimum, average and maximum waiting time in a linear manner. • Increasing the number of processes in Round Robin leads to a linear increase in waiting times. 7 8) Experiment 2 :no difference in results when all distribution values are from the uniform distribution Contents of psconfig and run files 8 9) Experiment 2 :no difference in results when all distribution values are from the uniform distribution Contents of exp file 9 10) Experiment 2 :no difference in results when all distribution values are from the uniform a distribution Box plots of the results for waiting times for RR, FCFS, SJF and PSJF 10 11) Experiment 2 :no difference in results when all distribution values are from the uniform a distribution Table shows averages for four scheduling criteria for each scheduling algorithm While all the algorithms have CPU Utilization and Throughput same (1 and 0.2606 respectively), SJF and PSJF have the lowest average turnaround time(546.87) and average waiting time(508.48). Therefore, SJF and PSJF are tied as winners. 11 12 12) Experiment 2 :no difference in results when all distribution values are from the uniform distribution Trend Checks • The boxplots represent waiting times for different number of processes with the processes increasing as we move to the right. • The plot shows that increasing number of processes leads to increase in average and maximum waiting time in a linear manner while the minimum waiting time remains the same. • Increasing the number of processes in FCFS leads to a linear increase in average and maximum waiting times. 13) Experiment 3: no difference in results when all distribution values are from the exponential distribution Contents of the psconfig and run files 13 14) Experiment 3: no difference in results when all distribution values are from the exponential distribution Contents of the exp file 14 15) Experiment 3: no difference in results when all distribution values are from the exponential distribution Box plots of the results for waiting times for RR, FCFS, SJF, and PSJF 15 16) Experiment 3: no difference in results when all distribution values are from the exponential distribution Table shows averages for four scheduling criteria for each scheduling algorithm • While all the algorithms have CPU Utilization and Throughput same (1 and 0.36076 respectively), SJF and PSJF have the lowest average turnaround time(329.89) and average waiting time(302.17). • Therefore, SJF and PSJF are tied as winners. 16 17) Experiment 3: no difference in results when all distribution values are from the exponential distribution Trend Checks 17 • The boxplots represent waiting times for different number of processes with the processes increasing as we move to the right. • The plot shows that increasing number of processes leads to increase in average and maximum waiting time in a linear manner while the minimum waiting time remains the same. • Increasing the number of processes in SJF leads to a linear increase in average and maximum waiting times. 18) Results of Stress Test: Experiment 1 No.of Process Results 1 Successful 10 Successful 100 Successful 1000 Successful 10000 Successful 100000 Failed 1000000 Failed 10000000 Failed 100000000 Failed 1000000000 Failed 18 19) Gantt Chart Results: Experiment 1 • The Gantt chart for the SJF, PSJF and the FCFS are the same for the first chart. • The Gantt chart for RR shows that the average waiting time (time spent in ready state) is more than the average waiting time for SJF,PSJF and FCFS.
