作業系統›Ch4 行程與執行緒管理
第 64 題/共 70 題
◀ OS 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 tt. Which of the following is true?

ProcessArrival TimeBurst Time
P1010
P216
P3122
P4133
📄 中央111
跳轉到第題
▤完整推導請見《WH 資工筆記 · 作業系統》Ch4 行程與執行緒管理
本章題號 · 61–70 / 70