Operating System Cpu Scheduling Algorithms 1
Q There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
  • A A. Tq = 15ms
  • B B. Tq = 40ms
  • C C. Tq = 45ms
  • D D. Tq = 50ms
Leave a Comment