Unit 5 Flashcards

1
Q

An operational element, such as an AND gate or an ALU

A

combinational element

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

A memory element, such as a register or a memory

A

state element

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

The approach used to determine when data is valid and stable relative to the clock

A

clocking methodology

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

A clocking scheme in which all state changes occur on a clock edge

A

edge-triggered clocking

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

A signal used for multiplexor selection or for directing the operation of a functional unit; contrasts with a data signal, which contains information that is operated on by a functional unit

A

control signal

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

A unit used to operate on or hold data within a processor

A

datapath element

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

The register containing the address of the instruction in the program being executed

A

program counter (PC)

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

A state element that consists of a set of registers that can be read and written by supplying a register number to be accessed

A

register file

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

To increase the size of a data item by replicating the high-order sign bit of the original data item in the high-order bits of the larger, destination data item

A

sign extend

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

A branch where the branch condition is satisfied and the program counter (PC) becomes the branch target

A

branch taken

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

A branch where the branch condition is false and the program counter (PC) becomes the address of the instruction that sequentially follows the branch

A

branch not taken

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

An implementation in which an instruction is executed in one clock cycle. While easy to understand, it is too slow to be practical

A

single clock cycle implementation

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

implementation technique in which multiple instructions are overlapped in execution, much like an assembly line

A

pipelining

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

When a planned instruction cannot execute in the proper clock cycle because the hardware does not support the combination of instructions that are set to execute

A

structural hazard

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

When a planned instruction cannot execute in the proper clock cycle because data that is needed to execute the instruction are not yet available

A

pipeline data hazard (or data hazard)

17
Q

A method of resolving a data hazard by retrieving the missing data element from internal buffers rather than waiting for it to arrive from programmer-visible registers or memory

A

forwarding or bypassing

18
Q

A specific form of data hazard in which the data being loaded by a load instruction has not yet become available when it is needed by another instruction

A

load use data hazard

19
Q

A stall initiated in order to resolve a hazard

A

pipeline stall or bubble

20
Q

When the proper instruction cannot execute in the proper pipeline clock cycle because the instruction that was fetched is not the one that is needed; that is, the flow of instruction addresses is not what the pipeline expected

A

control or branch hazard

21
Q

A method of resolving a branch hazard that assumes a given outcome for the conditional branch and proceeds from that assumption rather than waiting to ascertain the actual outcome

A

branch prediction

22
Q

The number of stages in a pipeline or the number of stages between two instructions during execution

A

pipeline latency

23
Q

An instruction that does no operation to change state

24
Q

An interrupt for which the address to which control is transferred is determined by the cause of the exception.

A

vectored interrupt

25
Interrupts or exceptions in pipelined computers that are not associated with the exact instruction that was the cause of the interrupt or exception
imprecise interrupt/exception
26
An interrupt or exception that is always associated with the correct instruction in pipelined computers
precise interrupt/exception
27
An advanced pipelining technique that enables the processor to execute more than one instruction per clock cycle by selecting them during execution
superscalar