The Shortest Job First (SJF) and the Shortest Remaining-Time First (SRTF) requires the computation of the...

 

Transcribed Image Text:

The Shortest Job First (SJF) and the Shortest Remaining-Time First (SRTF) requires the computation of the next CPU "burst length" for each process. i) What are the variables required to compute the CPU "burst length"? ii) The exponentially weighted moving average (EWMA) can be computed given that we have to = actual length of nth CPU burst, tn+1 =predicted value for next CPU burst, for a, 0 <a <1.write the formula to approximate the EWMA. iii) write the general formula for the expression in question 3.a.ii above. iv) Make two important assumptions for hte computation of the EWMA. bi) In a resource allocation graph, processes P1, P2, and P3 exist with three resources R1, R2, R3. R1 is assigned to P2, R2 is assigned to P3, and R3 is assigned P1. P1, P2, and P3 are requesting for R1, R2, and R3 respectively ii)Draw the resource allocation diagram. iii) Provide the conditions necessary for deadlocks to occur. iv)State whether a deadlock will occur or not. The Shortest Job First (SJF) and the Shortest Remaining-Time First (SRTF) requires the computation of the next CPU "burst length" for each process. i) What are the variables required to compute the CPU "burst length"? ii) The exponentially weighted moving average (EWMA) can be computed given that we have to = actual length of nth CPU burst, tn+1 =predicted value for next CPU burst, for a, 0 <a <1.write the formula to approximate the EWMA. iii) write the general formula for the expression in question 3.a.ii above. iv) Make two important assumptions for hte computation of the EWMA. bi) In a resource allocation graph, processes P1, P2, and P3 exist with three resources R1, R2, R3. R1 is assigned to P2, R2 is assigned to P3, and R3 is assigned P1. P1, P2, and P3 are requesting for R1, R2, and R3 respectively ii)Draw the resource allocation diagram. iii) Provide the conditions necessary for deadlocks to occur. iv)State whether a deadlock will occur or not.

Answer rating: 100% (QA)

i In a resource allocation graph process P1 P2 and P3 exist with three resources R1R2 R3 R1 is assigned to P2 R2 is assigned to P3 and R3 is assigned P1 P1 P2 and P3 are requesting for R1 R2 and R3 requesting ii Draw the resource ... View the full answer