homework 3 Version 0 |
|
👤 Author: by wangyl0911126com 2018-11-05 03:18:04 |
CPU Scheduling Algorithms
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 ?
Answer: tQ = 15ms