GATE CS 2014 Set 3 — Question 53
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+2 / -0HardSpeedup & EfficiencyInstruction PipeliningComputer Organization & ArchitecturePipeline StallsControl HazardsPipeline Stages & Throughput
Computer Organization & Architecture → Instruction Pipelining → Control Hazards
Last updated
Question
An instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM), and register writeback (WB) with stage latencies 1 ns, 2.2 ns, 2 ns, 1 ns, and 0.75 ns, respectively (ns stands for nanoseconds). To gain in terms of frequency, the designers have decided to split the ID/RF stage into three stages (ID, RF1, RF2) each of latency ns. Also, the EX stage is split into two stages (EX1, EX2) each of latency 1 ns. The new design has a total of eight pipeline stages. A program has 20% branch instructions which execute in the EX stage and produce the next instruction pointer at the end of the EX stage in the old design and at the end of the EX2 stage in the new design. The IF stage stalls after fetching a branch instruction until the next instruction pointer is computed. All instructions other than the branch instruction have an average CPI of one in both the designs. The execution times of this program on the old and the new design are and nanoseconds, respectively. The value of is __________.
Correct answer
1.5 to 1.6
Solution
For the old design ():
- Stages: IF, ID/RF, EX, MEM, WB (5 stages).
- Stage latencies: 1, 2.2, 2, 1, 0.75 ns.
- Clock cycle time ns.
- Branch outcome known at end of EX stage (3rd stage).
- Stall cycles for branch: The instruction is fetched (1), then stalls during ID/RF (2) and EX (3). The next instruction is fetched in cycle 4. So, penalty is stall cycles.
- Average CPI (): .
- Execution time per instruction: ns.
- Stages: IF, ID, RF1, RF2, EX1, EX2, MEM, WB (8 stages).
- Stage latencies: 1, , , , 1, 1, 1, 0.75 ns.
- Clock cycle time ns.
- Branch outcome known at end of EX2 stage (6th stage).
- Stall cycles for branch: The instruction is fetched (1), then stalls during ID, RF1, RF2, EX1, EX2. The next instruction is fetched in cycle 7. So, penalty is stall cycles.
- Average CPI (): .
- Execution time per instruction: ns.
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Instruction Pipelining
2026 Set 1 Q14Match each addressing mode in List I with a data element or an element of a data structure (in…2026 Set 1 Q15Consider a processor P whose instruction set architecture is the load-store architecture. The…2026 Set 1 Q16Which one of the following dependencies among the register operands of different instructions can…2026 Set 2 Q18Consider the following two statements about interrupt handling mechanisms in a CPU. S1: In…2026 Set 1 Q38The size of the physical address space of a processor is bytes. The capacity of a cache…