作業系統›Ch4 行程與執行緒管理第 64 題/共 70 題
64. Round-Robin、Waiting Time
#OS-04-064易Round-RobinWaiting Time
Consider the CPU burst timeline of four processes, as shown on the right side. The processes need to share one CPU, and the OS uses the round-robin algorithm with time quantum = 5 for scheduling. Let the context switch time be very close to 0. Let the average waiting time of the processes be . Which of the following is true?
| Process | Arrival Time | Burst Time |
|---|---|---|
| P1 | 0 | 10 |
| P2 | 1 | 6 |
| P3 | 12 | 2 |
| P4 | 13 | 3 |
📄 中央111
▤完整推導請見《WH 資工筆記 · 作業系統》Ch4 行程與執行緒管理