Re: [問題] Multiprogramming的問題
※ 引述《asp2tw.bbs@ptt.cc (文禾)》之銘言：
> 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)?
The t[k] in the critical path won't be influence by other processors.
(i.e. locked by other processors in the critical section.)
> (2)How would it be possible that T > t1+t2+…+tN, where T
> represents the time it takes to complete all N processes?
If the overhead of communication among these processors is too heavy
or the N processors have a sequentially executed order, it might be possible
that T > t1+t2+…+tN.
--
※發信站 [中央數學 織夢天堂 bbs.math.ncu.edu.tw]
‧FROM [how 從 218-168-222-3.dynamic.hinet.net 發表]
討論串 (同標題文章)
完整討論串 (本文為第 2 之 2 篇)：
Programming 近期熱門文章
PTT數位生活區 即時熱門文章
