作者newfantasy (没事少说话)
看板Grad-ProbAsk
标题[理工] 计算机组织与结构-拜托各位
时间Fri Apr 17 12:28:00 2009
For the pipeline in computer arithmetic, consider the following snippet of
code:
For I = 1 TO 100 DO {A[i] = (B[i]*C[i]) + D[i]}
Assume that each operation, multiplication and addition, requires 10 ns to
complete.A non-pipelined uniprocessor takes 20 ns to calculate A[i], and 2000
ns to execute the code. A pipelined unit could break this computation into two
stages in which the first stage performs the multiplication and the second
stage performs the addition,where the latches store the output of each stage
in the pipeline and each latch needs 2ns to load data.
(1) Draw the above two-stage pipeline scheme (including the latches).
(2) Calculate the time required to execute the above code (including the
latching time).
想请问题高应大电子系的考题，我真的看不太懂，板上的各位可以指点我一下吗?
前面几间放榜完，才发现，机会有点渺茫，这是我最後一间了，拜托各位了!!
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 163.23.5.176
1F：推 BF3716:[2] 第一管执行乘法花费10ns、第二管执行加法花费10ns 04/17 17:32
2F：→ BF3716:管线的时脉为max{10ns,10ns}+2ns =12ns 04/17 17:33
3F：→ BF3716:总共花费时间为{100+2-1}*12ns = 1212ns 04/17 17:33
4F：→ BF3716:[1]画图的话能请你翻课本吗? XD.. 04/17 17:35