The problem references a figure which I don't think you have provided,
and I don't know what A,B,C,D are or how they relate to S1, S2, S3, S4
so I can't solve the problem. But the principle is to find the one
stage which has the lowest throughput. That is the bottleneck. The
pipeline can't process
Can you please elaborate your answer ... ?
On Wed, Jan 30, 2013 at 10:37 PM, Don wrote:
> You have to identify the bottleneck in the pipeline. The time required
> for the bottleneck is the steady state time per operation of the
> pipelined processing. Then determine the time to do the 4 stages
>
You have to identify the bottleneck in the pipeline. The time required
for the bottleneck is the steady state time per operation of the
pipelined processing. Then determine the time to do the 4 stages
sequentially. The difference is the speed up.
Don
On Jan 30, 11:59 am, Ayush Kapoor wrote:
> Co
