作者asp2tw (文禾)
看板Programming
标题[问题] Multiprogramming的问题
时间Wed Apr 11 18:03:25 2007
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