1.
一般都是用penalty算的branch cycle的 這個卻不是
沒看過類似的題目..

A linear pipeline system system with K stages and cycle time =T .
Assume that:
N = total number of instructions of program,
P = the probability of conditional branch instructions ,
Q = the probability of branch taken ,
B = the number of pipelone cycles wasted between a branch and
    its branch target.

(a)Derive an equation for effective throughput for wth linear pipeline.
(b)Find out the maximum throughput of the linear pipeline.
(c)If K=10,T=20ns,N=10,000,P=0.2,Q=0.8 and B=9
   calculate the performance degradation factor D.

解:
(a)
branch額外產生的cycle = N*PQB
總cycle數目=K-1+N(1+PQB)
Execuation Time =[K-1+N(1+PQB)]*T

所以effective throughput=1/[K-1+N(1+PQB)]*T

(b)即 1/[K-1+N]*T

(c)看不懂問啥

請大大幫幫看看是否正確 甘恩

2.
另問http://www.pixavid.com/l14Qbo/
漢明碼的Syndrome word
是在指什麼
P8P4P2P1等Parity bits?
還是C8C4C2C1等Check bits?      <<我覺得是這個?
第(3)小題直接XOR兩個Syndrome word就可?


--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 122.125.76.223
推 kai5566:哪一年的阿?
※ 編輯: sroeud7l        來自: 122.125.72.71        (01/20 23:38)
※ 編輯: sroeud7l        來自: 122.125.72.71        (01/20 23:49)