Topic: Uniprocessor Scheduling You were given five processes...

Topic: Uniprocessor Scheduling You were given five processes with their arrival time and execution time for each in the table. A scheduling algorithm is used to estimate the CPU time required to allocate to the processes and threads. The prime goal of any CPU scheduling algorithm is to keep the CPU as busy as possible for improving CPU utilization Question 1: Develop the schedule (time diagram) for the following Operating System Scheduling Algorithms 1. First-Come-First-Served (FCFS) 2. Shortest Process Next (SPN) 3. Round Robin Assume the length of the time quantum, or slice is 1 (q=1) Process Arrival Time Execution Time P1 0 4 P2 2 3 P3 3 2 P4 4 4 P5 6 3 Question 2: Consider the expectations below: Expectations: -The average waiting time should be smaller than FCFS -Performance of the scheduling algorithm should be archived in minimum average waiting time (Fast) Which Scheduling Algorithm you would use? Explain your response.

Transcript

00:01 Hello students to compare the completion time for the different scheduling algorithm as the round robin round robin round robin algorithm that is also called as rr algorithm and the and the another one is shortest remaining first term algorithm shortest shortest remaining remaining first time first algorithm time first algorithm that is srtf srtf algorithm so you can see so you can see here you can see here the cpu values for the completion time for the processes are being provided so we'll give up the steps like we'll complete the table as it requires we requires the rr and the srtf values so the time slice for the round robin is you can say the times time slice is time slice given is for round robin is one second and the process switch time is the process process switch time is switch switch time is is of point one seconds is of point one seconds so you can see for the round robin we have the process will start we have all together five processes fine we have five processes p1 p2 p3 p4 as well as the p5 so we have all this five processes with its cpu value provided as a 50 15 for the p2 30 45 and the 10 so now you can see that in a round robin each process gets a time slice of one seconds before it is scheduling it gets the time slice of one so before it is scheduling to the next process so the process switch time is also a point one seconds is added to the completion time for the each process so we can say here we will be having the one second for before the scheduling switch so after for the next process for the switch of for the time of switch we will be having point one seconds so we can say that a round robin for the process one will be as 50 is a cpu plus the one second one second as the time slice and again point one second as the time switch switch time so our total value will be as 51 .1 seconds fine it will be 51 .1 seconds so it requires 50 is here it like processes from a 50 before the process scheduling time then for the going moving to the next process it will also count the size like the switch time so it these three are combined so next for the moving towards the second processor for the second processor we also now we will again began with the first that is scheduled…

Question

Please give Ace some feedback