作者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