Superscalar Processes Flashcards

1
Q

A superscalar processor architecture is one in which [x] [y] - [i] [f], [l], [s], [c] - can be initiated [simultaneoulsy] and [e] [i].

A

common
instructions
integer, floating point arithemtic, load, store, conditional branches

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

Superscalars are designed to [i] the performance of the [e] of [i]

A

improve
execution
scalar instructions

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

Define instruction level parallelism

A

the degree to which, on average, the instructions of a program can be executed in parall.

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

A combination of [c] and [h] can be used to [m] instruction-level parallelism.

A

compiler
hardware techniques
maximise

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

What are the five limitations to parallelism that a system must cope with?

A
True data dependency
Procuedural depdency
Resource conflics
Output dependency
Antidepdency
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

True data dependy is also known as

A

Write read dependency

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

Instructions following a branch have a [p] on the branch and cannot be [e] until the [b] is [e]

A

procedural depedency
executed
branch
executed

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

On a superscalar pipeline, the consequence for a [p] dependency is [s], since a [g] magnitude of [o] is [l] with each delay.

A
procedural dependency
severe
greater
opportunity
lost
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

If [v] length instructions are used, another sort of [p] can occur. Because the [l] of an [i] is not known, it must be [p] [d] before the [f] instruction can be [f]

A
variable
procedural dependency
length
instruction
partially
decoded
following
fetched
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

A resource conflict is a [x] of [t] or more [e] for the [c] [r] at the same time.

A
competition
two 
instructions
same
resource
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Give examples of resources:

A

memories, caches, busses

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

Resource conflicts can be [o] by [d] resources.

A

overcome

duplicating

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

True data depencies [c] be [o]

A

cannot

overcome

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

Instruction level parallelism [e] when [i] in a [s] are [i] and thus can be [e] in [p] by [o]

A
exists
instructures
sequence
independent
executed
parallel
overlapping
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Instruction-level is [d] by the [f] of [t] and [p] in the code

A

determined
frequency
true data
procedural dependencies

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

Machine paralleism is a [m] of the ability of the [p] to take [a] of [i]. Machine parallelism is determined by the [n] that can be [f] and [e] at the same time and by the [s] and [s] of the mechanism that the [p] uses to [f] [i] instructions

A
measure
processor
advantage
independent instructions
number of instructions
fetched
executed
speed
sophistication
processor
find
independent
17
Q

Instruction issue refers to [x]

A

the process of initating instruction execution in the processor’s function units

18
Q

Instruction-issue policy refers to

A

the protocol used to issue instructions