GateAI
Instruction Pipelining

GATE CSE 2016 Set 2 · Q33

NAT2 marksMedium

Time

Consider a 3 GHz (gigahertz) processor with a three-stage pipeline and stage latencies au1 au_1, au2 au_2, and au3 au_3 such that au1=3au2/4=2au3 au_1 = 3 au_2/4 = 2 au_3. If the longest pipeline stage is split into two pipeline stages of equal latency, the new frequency is _________ GHz, ignoring delays in the pipeline registers.

Your answerNumerical answer

Enter a value to check

Solution

Step-by-step verified solution

Official answer: 4 (±0.1) (±0.1)

Instruction Pipelining

The clock frequency of the processor is f=3 GHzf = 3\text{ GHz}, so the initial clock cycle time is:

T=1f=13 nsT = \frac{1}{f} = \frac{1}{3}\text{ ns}

Given the relation:

au1=34au2=2au3 au_1 = \frac{3}{4} au_2 = 2 au_3

Expressing each stage latency in terms of au2 au_2:

au1=34au2,au3=38au2 au_1 = \frac{3}{4} au_2, \quad au_3 = \frac{3}{8} au_2

Thus, au2 au_2 is the longest stage. The clock cycle time of a pipeline is determined by the maximum stage latency (ignoring register delays):

T=au2=13 nsT = au_2 = \frac{1}{3}\text{ ns}

From this, we find:

  • $

au_1 = 34\frac{3}{4} \times 13\frac{1}{3} = 14\frac{1}{4} ns\text{ ns} = 0.25 ns\text{ ns}$

  • $

au_3 = 38\frac{3}{8} \times 13\frac{1}{3} = 18\frac{1}{8} ns\text{ ns} = 0.125 ns\text{ ns}$

When the longest stage au2 au_2 is split into two equal stages, each new stage has latency:

au2′=au22=16 ns≈0.167 ns au_2' = \frac{ au_2}{2} = \frac{1}{6}\text{ ns} \approx 0.167\text{ ns}

The new stage latencies are au1=0.25 ns au_1 = 0.25\text{ ns}, au2′=0.167 ns au_2' = 0.167\text{ ns}, au2′=0.167 ns au_2' = 0.167\text{ ns}, and au3=0.125 ns au_3 = 0.125\text{ ns}.

The new bottleneck stage is now au1=14 ns au_1 = \frac{1}{4}\text{ ns}.

Therefore, the new clock frequency is:

fnew=1max⁡(au1,au2′,au3)=11/4 ns=4 GHzf_{\text{new}} = \frac{1}{\max( au_1, au_2', au_3)} = \frac{1}{1/4\text{ ns}} = 4\text{ GHz}

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 Q33 of the GATE CSE 2016 Set 2 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. 16 of them are 2-mark NAT questions like this one, and GATE CSE 2016 Set 2 has 2.

How GATE tests Instruction Pipelining

More from GATE CSE 2016 Set 2

Share this solution

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

GateAI solution cardGATE CSE 2016 Set 2 · Q33 · NAT

Consider a 3 GHz (gigahertz) processor with a three-stage pipeline and stage latencies au1, au2, and au3 such that au1 = 3 au2/4 = 2 au3. If the longest pipeline stage is split into two pipeline stages of equal latency, the new frequency is … GHz, ignoring delays in the pipeline registers.

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.