Consider the following three processes in the FCFS.Process ID. Brust-time. Arrival-timeP1 3 3P2 6 6P3 9 9What is the average waiting time?2345
Question
Consider the following three processes in the FCFS.Process ID. Brust-time. Arrival-timeP1 3 3P2 6 6P3 9 9What is the average waiting time?2345
Solution
To calculate the average waiting time for the given processes in First Come First Serve (FCFS) scheduling, we first need to calculate the waiting time for each process. The waiting time is the amount of time a process has been in the ready queue waiting to get the CPU.
-
Waiting time for P1 = 0. (As it is the first process so, it does not wait)
-
Waiting time for P2 = Finish time of P1 - Arrival time of P2 = (Arrival time of P1 + Burst time of P1) - Arrival time of P2 = (3 + 3) - 6 = 0
-
Waiting time for P3 = Finish time of P2 - Arrival time of P3 = (Arrival time of P2 + Burst time of P2) - Arrival time of P3 = (6 + 6) - 9 = 3
Now, the average waiting time = (Waiting time of P1 + Waiting time of P2 + Waiting time of P3) / Number of processes
So, the average waiting time = (0 + 0 + 3) / 3 = 1 unit of time.
Similar Questions
Consider the given table below and find Completion time (CT), Turn-around time (TAT), Waiting time (WT), Response time (RT), Average Turn-around time and Average Waiting time in case of FCFS scheduling. Process ID Arrival time Burst time P1 2 2 P2 5 6 P3 0 4 P4 0 7 P5 7 4a.The waiting time for process P1 is 9msb.The waiting time for process P1 is 0msc.The waiting time for process P1 is 8msd.The waiting time for process P1 is 4ms
Five batch jobs A, B, C, D and E arrive at same time. They haveestimated running times 10, 6, 3, 4 and 8 ms. For each of the followingalgorithm determine mean process turnaround time. Consider processswapping overhead is 1 ms.1) FCFS2) Round-Robin (Time quantum = 2 ms)
Suppose that the following processes arrive for execution at the times indicated.Each process will run for the amount of time listed. In answering the questions, usenonpreemptive scheduling, and base all decisions on the information you have at the timethe decision must be made.Process Arrival Time Burst TimeP1 0.0 8P2 0.4 4P3 1.0 1a. What is the average turnaround time for these processes with the FCFSscheduling algorithm?b. What is the average turnaround time for these processes with theSJF scheduling algorithm?c. The SJF algorithm is supposed to improve performance, but notice that we choseto run process P1 at time 0 because we did not know that two shorter processes wouldarrive soon. Compute what the average turnaround time will be if the CPU is left idle forthe first 1 unit and then SJF scheduling is used. Remember that processes P1 and P2 arewaiting during this idle time, so their waiting time may increase. This algorithm could becalled future-knowledge scheduling.Exercises 3.Consider the following set of processes, with the length of the CPU burstgiven in milliseconds:Process Burst Time PriorityP1 2 2P2 1 1P3 8 4P4 4 2P5 5 3
Solve following example by FCFS and SJF CPU schedulingalgorithm. Draw Gantt Chart and calculate Average Waiting Timeand Average Turnaround time.Process Arrival Time Burst TimeP0 0 10P1 1 6P2 3 2P3 5 4
Q5. Consider the set of 6 processes whose arrival time and burst time are given below-Arrival time Burst timeP1 0 6P2 1 7P3 2 8P4 3 10P5 4 3P6 5 4If the CPU scheduling policy is Round Robin with time quantum = 3, calculate the average waiting time andaverage turnaround time. For the given scheduling Algorithm (a) FCFS (b) SJF (c) SRTF
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.