retagged by
745 views

1 Answer

Best answer
1 1 vote
in pipeline A, first instruction executes in 16ns (8stage*2ns). after that each 1 instruction get completed in 2ns.

so total delay is 1*16 + 99*2 = 214ns

in pipeline B, first instruction executes in 15ns =(3+3+3+3+3). after that each one instruction get completed in 3ns. (as delay of pipeline is maximum delay of any stage)

so total delay is 1*15 + 99*3 =  297 + 15 = 312ns

so time saved is 312 - 214 = 98 ns
selected by
Answer:
Position:
Show:

Related questions

3 3 votes
1 answers 1 answer
3.6k
3.6k views
Bikram asked Nov 25, 2016
3,569 views
A pipelined processor has two branch delay slots. An optimizing compiler can fill one of these slots $85$ % of the time, and can fill the second slot only $20$ % of the t...
0 0 votes
2 answers 2 answers
755
755 views
Bikram asked Nov 25, 2016
755 views
A non-pipeline system takes $25$ ns to process a task. The same task can be processed in a six-segment pipeline in a clock cycle of $10$ ns.The speed-up rotation of the p...
2 2 votes
1 answers 1 answer
1.2k
1.2k views
Bikram asked Nov 25, 2016
1,245 views
We have two implementations of the same Instruction Set Architecture (ISA). Machine $A$ has a clock cycle time of $50$ ns and a CPI of $4.0$ for a program, while machine ...
2 2 votes
1 answers 1 answer
881
881 views
Bikram asked Nov 25, 2016
881 views
In a seven-segment pipeline, each segment takes $1$ cycle. Assuming there are no stalls, the number of clock cycles required to process $180$ tasks in a seven – segment p...