[問題] Multiprogramming的問題
Suppose that a multiprogrammed system has a load of N
processes with individual total execution times of t1, t2,
…,tN.
(1)How would it be possible that the execution time
could be as small as maximum (t1, t2, …, tN)?
(2)How would it be possible that T > t1+t2+…+tN, where T
represents the time it takes to complete all N processes?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.118.234.195
討論串 (同標題文章)
完整討論串 (本文為第 1 之 2 篇)：
Programming 近期熱門文章
PTT數位生活區 即時熱門文章
