[理工] [OS] scheduling
恐龍的習題
Consider a system running ten IO-bound tasks and one CPU-bound task.
Assume that the I/O-bound tasks issue an I/O operation once for every
millisecond of CPU computing and that each I/O operation tasks 10
milliseconds to complete.Also assume that the context-switching overhead
is 0.1 millisecond and that all processes are long-running tasks. Describe
the CPU utilization for a round-robin scheduler when:
a. The time quantum is 1 millisecond
b. .. .. .. .. 10 millisecond
不太懂這題的意思 請問怎麼算..
--
※ 發信站 :批踢踢實業坊(ptt.cc)
◆ From: 114.37.178.177
※ 編輯: ceo890710 來自: 114.37.178.177 (10/14 22:24)
推
10/15 22:00, , 1F
10/15 22:00, 1F
推
10/15 22:03, , 2F
10/15 22:03, 2F
推
10/15 22:42, , 3F
10/15 22:42, 3F
→
10/16 02:13, , 4F
10/16 02:13, 4F
推
10/16 02:20, , 5F
10/16 02:20, 5F
→
10/16 02:21, , 6F
10/16 02:21, 6F
討論串 (同標題文章)
以下文章回應了本文：
完整討論串 (本文為第 3 之 5 篇)：