Register

A 4-stage pipeline has ..

• retagged by
2,828 views
1 1 vote

A 4-stage pipeline has the stage delays as 150,120,160 and 140 nanoseconds respectively . Registers that are used between the stages have a delay of 5 nanoseconds  each  .Assuming constant clocking rate,the total time taken to process 1000 data items  on this pipeline will be

a)120.4 microseconds

b)160.5 microseconds

c)165.5 microseconds

d)590.0 microseconds

1 Answer

1 1 vote
Maximum stage delay will be 160 ns and 5 ns uniform delay register are being used . so total time for each stage should be 165ns so that every stage can work well.

tp = 165ns

formula is (k+(n-1)) tp. k=4 because stages are 4

(4+999) 165 ns = 165.5 micro seconds .

option c
Voting & Accepting an answer helps improve the community
← Previous · The number of bits (...Next → · Identify the class o...
← Previous in category · The number of bits (...Next in category → · Minimum and maximum ...
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.2k
1.2k views
kathan Mistry asked Aug 9, 2022
1,175 views
In a pipelined architecture Static branch prediction is used with branch taken assumption. Assume that 30% of the instructions executed for a program are branch instructions. Each stage has 2 nsec delay. Average Execution time(in nsec) if 80 % of the instructions are taken?
In a pipelined architecture Static branch prediction is used with branch taken assumption. Assume that 30% of the instructions executed for a program are branch instructi...
0 0 votes
1 answers 1 answer
442
442 views
mv_ind asked Dec 24, 2024
442 views
Should we consider Instruction Pipeline max delay separate of Inter-stage register delay or not?
For example consider the following setup - Here there are 3 stages with delays 10ns, 5ns, 2ns and delays by inter-stage registers are 2ns, 3ns, 1ns. Now how many ns does ...
78 78 votes
11 answers 11 answers
33.2k
33.2k views
go_editor asked Sep 28, 2014
33,223 views
GATE CSE 2014 | Set 1 | Question: 43
Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is exec...
197 197 votes
9 answers 9 answers
76.7k
76.7k views
Kathleen asked Sep 22, 2014
76,695 views
GATE CSE 2005 | Question: 68
A $5$ stage pipelined CPU has the following sequence of stages:IF – instruction fetch from instruction memoryRD – Instruction decode and register readEX – Execute: ALU op...