16 Pipelining Flashcards

1
Q

Stages of the fetch-execute cycle?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is pipelining?

A

Pipelining is an implementation technique in which multiple tasks are executed simultaneously

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Analogous to single-cycle datapath diagram?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Analogous to pipelined datapath diagram?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Pipelining performs stages concurrently.

Latency and Throughput changes of pipelining?

A

Latency The elapsed time from the start to the finish of a task. Latency is NOT improved by pipelining.

Throughput Number of instructions performed per unit of time. Pipelining IMPROVES the throughput.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Single-cycle datapath

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Pipelined datapath

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Latency

A

This is the elapsed time from start to finish of a particular instruction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Throughput

A

How many instructions can be completed per unit of time (usually a number of cycles)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Pipelining only improves ….

A

Pipelining only improves throughput

It doesn’t make the processor faster

It does allow more instructions to be completed within a window of time

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Pipelining delay problems?

A

Then, the microprocessor needs to WAIT!

If the instructions MUST be completed in the correct order, then we need to wait for longer instructions to complete, e.g., Instruction 3 takes 2 cycles => need to wait

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

But what if we don’t need to wait (no data dependencies)?

A
  • We can therefore carry out instructions “out of order” o In other words, if we are ready to go, then GO
  • BUT, only if we don’t need to wait for a previous instruction to supply relevant data
  • AND, we might need to wait later on when the data DOES become important/relevant
  • This requires knowledge of the program flow
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Single-cycle or non-pipelined processor?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Pipelined processor

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Additions made to a pipelined processor?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly