Suppose that the following processes arrive for execution at the time indicated.
ID: 3589662 • Letter: S
Question
Suppose that the following processes arrive for execution at the time indicated. Each process will run the listed amount of time Process P1 P2 P3 a) What is the average waiting time for these processes with the FCFS Arrival Time 0.0 0.4 1.0 Burst Time 8 4 1 scheduling algorithm? What about the average turnaround time? algorithm? (shortest remaining time first) scheduling algorithm? b) What is the average waiting time for these processes with SJF scheduling c) What is the average waiting time for these processes with the SRTFExplanation / Answer
Solution:
a)
Gantt Chart:
0 8 12 13 (these are the completion times)
Average TAT= (8+11.6+12)/3= 10.5333
b)
Gantt Chart:
0 8 9 13 (these are the completion times)
Average waiting time= (0+8.6+7)/3= 5.2
c)
Gantt Chart:
0 0.4 1 2 5.4 13 (these are the completion times)
Average waiting time= (5+01+0)/3= 2
AT=> Arrival Time
BT=> Burst Time
CT=> Completion time
TAT=> Turn Arround Time
WT=> Waiting Time
I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)
P1 P2 P3Related Questions
Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.