1 votes 1 votes Consider a uniprocessor system with four processes having the following arrival and burst times: $$\begin{array}{|c|c|c|l|} \hline&\text{Arrival Time}&\text{CPU Burst Time} \\ \hline P1&0&10\\P2&1&3\\P3&2.1&2\\P4&3.1&1 \\ \hline\end{array}$$ Calculate the average waiting time and also the average turnaround time if shortest (remaining) job first (SJF) scheduling policy is used with pre-emption. Assume that the context switching time is zero. Note that in SJF, if at any point there is a tie, then the job that arrived earlier will get priority. Now consider the continuous arrival of new jobs at times $4, 5, 6, 7, \dots $ following $P4$, with CPU burst times of $2$ units each. In this case, what will be the turnaround time of $P1$? Justify your answer Operating System isi2014-pcb-cs descriptive operating-system process-scheduling + – go_editor asked May 31, 2016 edited May 14, 2021 by soujanyareddy13 go_editor 636 views answer comment Share Follow See 1 comment See all 1 1 comment reply Tauhin Gangwar commented May 31, 2016 reply Follow Share where are the burst time's/arrival time of first 4 processes 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes TAT=3.5 ms and WT is =1.5 ms time from (0-4) is not counted in calucation as it assumed that cpu is doing some other work G Phalkey answered Jan 15, 2019 G Phalkey comment Share Follow See 1 comment See all 1 1 comment reply Priyansh Singh commented Sep 22, 2020 reply Follow Share How you did without even complete question given ? 0 votes 0 votes Please log in or register to add a comment.