edited by
14,407 views
47 47 votes

Consider the following processors (ns stands for nanoseconds). Assume that the pipeline registers have zero latency. 

  • $\text{P1:}$ Four-stage pipeline with stage latencies $\text{1 ns, 2 ns, 2 ns, 1 ns}$. 
  • $\text{P2:}$ Four-stage pipeline with stage latencies $\text{1 ns, 1.5 ns, 1.5 ns, 1.5 ns}$. 
  • $\text{P3:}$ Five-stage pipeline with stage latencies $\text{0.5 ns, 1 ns, 1 ns, 0.6 ns, 1 ns}$. 
  • $\text{P4:}$ Five-stage pipeline with stage latencies $\text{0.5 ns, 0.5 ns, 1 ns, 1 ns, 1.1 ns}$. 

Which processor has the highest peak clock frequency?

  1. $\text{P1}$
  2. $\text{P2}$
  3. $\text{P3}$
  4. $\text{P4}$

7 Answers

Best answer
64 64 votes
frequency $=\dfrac{1}{ \text{max(time in stages)}}$
for $P_3$, it is $\dfrac{1}{1} = 1 \; \textsf{GHz}$

for $P_1$, it is $\dfrac{1}{2} = 0.5\; \textsf{GHz}$

for $P_2$, it is $\dfrac{1}{1.5} = 0.67\;\textsf{GHz}$

for $P_4$, it is $\dfrac{1}{1.1} = 0.90 \;\textsf{GHz}$

Correct Answer: $C$
edited by
17 17 votes

Lesser the time-period of the clock, higher the frequency of the clock (i.e) number of clock-cycles per second.

To get the processor with the highest clock-frequency find the processor with the lowest time-period.

P1 : Time period = max ( 1 ns, 2 ns, 2 ns, 1 ns ) = 2 ns 

P2 : Time period = max ( 1 ns, 1.5 ns, 1.5 ns, 1.5 ns ) = 1.5 ns

P3 : Time period = max (0.5 ns, 1 ns, 1 ns, 0.6 ns, 1 ns ) = 1 ns

P4 : Time period = max ( 0.5 ns, 0.5 ns, 1 ns, 1 ns, 1.1 ns ) = 1.1 ns

Time-period of P3 < P4 < P2 < P1

So clock frequency of P3 > P4 > P2 > P1.

So P3 has the highest clock-frequency.  Option C) 

4 4 votes
Here , time for pipeline P1= 2 ns, and Frequency = 1/tp = 1/ 2 ghz= 0.5 ns.

          Time for p2=1.5 ns, similarly fp = 0.66 ns

          same for p3= 1 ns ,so fp = 1 ns and  p4= 1.1 ns , so fp =0.909 ns .

Hence , My ans will be P3.
0 0 votes

Just find that which pipeline had the lowest clock genration time and it will give the highest clock frequency

 

Bcoz clock genration time is inversly propotional to the clock frequency  

0 0 votes
F = 1/T

Clock time of the following processors
P1 = 2 ns
P2 = 1.5 ns
P3 = 1 ns
P4 = 1.1 ns

So, P3 is taking least time hence P3 has highest clock frequency

Option C
0 0 votes
Generally, one stage of pipeline is executed in one clock cycle.
So, here we have different processor with different stage times. We will consider maximum time of stage for that processor as time for all stages

Max stage time => single cycle time => frequency (1/Time period of one cycle)
 
Answer:
Position:
Show:

Related questions

88 88 votes
13 answers 13 answers
35.7k
35.7k views
go_editor asked Sep 28, 2014
35,748 views
An instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM), a...
78 78 votes
11 answers 11 answers
33.2k
33.2k views
go_editor asked Sep 28, 2014
33,179 views
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...
9 9 votes
5 answers 5 answers
8.9k
8.9k views
go_editor asked Sep 28, 2014
8,853 views
In the context of modular software design, which one of the following combinations is desirable?High cohesion and high couplingHigh cohesion and low couplingLow cohesion ...
197 197 votes
8 answers 8 answers
76.5k
76.5k views
Kathleen asked Sep 22, 2014
76,509 views
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...