GateAI
Instruction Pipelining

GATE CSE 2014 Set 3 · Q9

MCQ1 markEasy

Time

Consider the following processors (ns stands for nanoseconds). Assume that the pipeline registers have zero latency. P1: Four-stage pipeline with stage latencies 1 ns, 2 ns, 2 ns, 1 ns. P2: Four-stage pipeline with stage latencies 1 ns, 1.5 ns, 1.5 ns, 1.5 ns. P3: Five-stage pipeline with stage latencies 0.5 ns, 1 ns, 1 ns, 0.6 ns, 1 ns. P4: Five-stage pipeline with stage latencies 0.5 ns, 0.5 ns, 1 ns, 1 ns, 1.1 ns. Which processor has the highest peak clock frequency?

Select one answerSingle correct

Pick an option to check

Solution

Step-by-step verified solution

Official answer: C) P3

Instruction Pipelining

The clock period (TT) of a pipelined processor is dictated by the maximum stage latency plus pipeline register delay:

T=max⁡(stage latencies)+register delayT = \max(\text{stage latencies}) + \text{register delay}

Since the pipeline registers have zero latency:

  • P1: T1=max⁡(1,2,2,1)=2 ns  ⟹  f1=12 ns=0.5 GHz=500 MHzT_1 = \max(1, 2, 2, 1) = 2\text{ ns} \implies f_1 = \frac{1}{2\text{ ns}} = 0.5\text{ GHz} = 500\text{ MHz}

  • P2: T2=max⁡(1,1.5,1.5,1.5)=1.5 ns  ⟹  f2=11.5 ns≈666.67 MHzT_2 = \max(1, 1.5, 1.5, 1.5) = 1.5\text{ ns} \implies f_2 = \frac{1}{1.5\text{ ns}} \approx 666.67\text{ MHz}

  • P3: T3=max⁡(0.5,1,1,0.6,1)=1.0 ns  ⟹  f3=11.0 ns=1.0 GHz=1000 MHzT_3 = \max(0.5, 1, 1, 0.6, 1) = 1.0\text{ ns} \implies f_3 = \frac{1}{1.0\text{ ns}} = 1.0\text{ GHz} = 1000\text{ MHz}

  • P4: T4=max⁡(0.5,0.5,1,1,1.1)=1.1 ns  ⟹  f4=11.1 ns≈909.09 MHzT_4 = \max(0.5, 0.5, 1, 1, 1.1) = 1.1\text{ ns} \implies f_4 = \frac{1}{1.1\text{ ns}} \approx 909.09\text{ MHz}

Processor P3 has the smallest clock period (1.0 ns1.0\text{ ns}) and hence the highest peak clock frequency (1 GHz1\text{ GHz}).

Therefore, C is the correct option.

Try the question first, then check your work.

Think the official key or this write-up is wrong?

Report error or challenge

Examiner trap

The misconception this question tests

This Instruction Pipelining previous year question is Q9 of the GATE CSE 2014 Set 3 paper. Find more GATE CSE PYQs on Instruction Pipelining in Computer Organization and Architecture, or browse all GATE CSE PYQs.

Free diagnostic

Where do you stand for GATE?

Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 5 related Instruction Pipelining PYQs now with no account.

One GATE CSE PYQ every morning

An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.

Instruction Pipelining in GATE CSE

Instruction Pipelining has 25 GATE CSE PYQs across 20 papers from 2011 to 2026. 3 of them are 1-mark MCQs like this one, and GATE CSE 2014 Set 3 has 2.

How GATE tests Instruction Pipelining

More from GATE CSE 2014 Set 3

Share this solution

A plain-text card for WhatsApp or Telegram study groups.

GateAI solution cardGATE CSE 2014 Set 3 · Q9 · MCQ

Consider the following processors (ns stands for nanoseconds). Assume that the pipeline registers have zero latency. P1: Four-stage pipeline with stage latencies 1 ns, 2 ns, 2 ns, 1 ns. P2: Four-stage pipeline with stage latencies 1 ns, 1.5 ns, 1.5 ns, 1.5 ns. P3: Five-stage pipeline with stage latencies 0.5 ns, 1 ns, 1 ns, 0.6 ns, 1 ns. P4: Five-stage pipeline with stage latencies 0.5 ns, 0.5 ns, 1 ns, 1 ns, 1.1 ns. Which processor has the highest peak clock frequency?

Topic-wise GATE CS PYQs with verified steps

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.