Back to Topic 1.1 — Hardware and operation
1.1.6Computer Science5 flashcards

Pipelining

Practice Flashcards

Flip to reveal answers
Card 1 of 51.1.6
1.1.6
Question

What is pipelining?

Click to reveal answer

Track your progress — Sign up free to save your progress and get smart review reminders based on spaced repetition.

All 5 Flashcards — Pipelining

Sign up free to track progress and get spaced-repetition review schedules.

Card 1definition

Question

What is pipelining?

Answer

Overlapping the stages of the fetch–decode–execute cycle, so one instruction executes while the next is decoded and a third is fetched.

Card 2concept

Question

Does pipelining make one instruction faster?

Answer

**No.** It still passes through every stage. What improves is **throughput** — how many complete per second.

Card 3formula

Question

How long do n instructions take in a k-stage pipeline?

Answer

**k + (n − 1)** stage-times — the k being the one-off cost of filling the pipeline.

Card 4definition

Question

Name the three causes of a pipeline stall.

Answer

**Branches** (the next instruction is unknown), **data dependencies** (waiting for a result), **resource conflicts** (two stages want the same hardware).

Card 5concept

Question

Why is a deeper pipeline not always better?

Answer

It overlaps more work, but a **wrong branch prediction costs more** because there is more to discard and refill.

Track your progress with spaced repetition

Sign up free — Aimnova tells you exactly which cards to review and when, so you remember everything before your IB exam.

Start Free