Module 19: Multi-core computing Operating Systems
  Lecture 37: Multi-core computing CPU Scheduling
 


SJF

  • Though optimal, not practical.
    • No way to find the CPU burst.
  • Scheduling techniques try to approximate SJF
    • Guess/predict the next burst ( : Predicted burst. : Actual burst)
  • Burst guess is obtained by exponentialaveraging.
  • is a system wide scheduling constant.
  • is a weight factor.

Example of “Guessing”