Lesson 1--Review of Computer Architecture Flashcards

1
Q

Instruction Level Parallelism (ILP)

A
  • -Executes multiple operations simultaneously in a given cycle.
  • -Program’s property. # of instructions exectuted per cycle depends on the program.
  • -Independent of hardware
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Low Instructions Per Cycle (IPC) is a result of…

A
  • -strict sequential semantics

- -instructions stalled for data or resource release by other instructions

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

Pipelining

A

Used to overlap instructions

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

Pipelines in modern CPUs have the following characteristics

A
  • -execution stages are divided into several steps
  • -a later operation can share the resources used by the first operation in previous cycles
  • -shared hardware can be pipelined
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Given a programs function unit cycles and the percentage of program’s percentage of instructions using each function unit how would the Cycles Per Instruction (CPI) be calculated?

A

((FU1cycles x FU1percentage) + (FU2cycles x FU2percentage) + (FU3cycles x FU3percentage) + …)/100

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

For a pipeline that is k stages deep, how many cycles does it take to fill the pipeline?

A

k - 1

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

VLIW stands for.

A

Very Long Instruction Word

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

How many operations can a VEX processor have in each cycle using VLIW?

A

4

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

In a VEX processor, what are the requirements for the instructions in a single word?

A

­ –cannot have dependencies
­ –cannot share resources
­ –only one memory access per word

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

Read After Write (RAW)

A

True dependency

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

Write After Write (WAW)

A

False dependency

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

Write After Read (WAR)

A

False dependency

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

3 Minimizing Dependencies Techniques

A
  • -Branch prediction/ Speculation
  • -Predication
  • -Register Renaming
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Branch prediction

A

Predict which branch might be taken

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

Predication

A

Use conditional moves

execute all the branch condition’s statements, but don’t commit them to memory until the branch conditions are known

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

Register Renaming

A

Used to avoid WAW and WAR dependencies

17
Q

What are the key performance metrics for Embedded Processors

A
  • High Performance
  • Low Cost
  • Low Energy Consumption
18
Q

Which processors would be good for embedded processors?

  • Superscalar, out of order
  • Superscalar, in order
  • VLIW, in order
  • VLIW, out of order
A

VLIW, in order

because multiple instructions in a slot lead to better performance with the most energy efficient solution.

19
Q

How is clock frequency related to energy

A

1/e -> f^2

20
Q

How deep are the pipelines in modern high performance processors?

  • 5 to 7 stages
  • 8 to 10 stages
  • 15 to 20 stages
  • 100+ stages
A

15 to 20 stages

21
Q

WhatistheCPI?

MIPSmachine:
Aloadtakes5cycles
Astoretakes4cycles
AnR­typeinstructiontakes4cycles
Branchtakes3cycles
Jumptakes3cycles
For a program,
50%R­type,
10%load,
20%store,
8%branch,
29%jumpinstructions
A

R­typeinstructions:4cycles,50%=450
loadinstructions:5cycles,10%=5
10
storeinstructions:4cycles,20%=420
branchinstructions:3cycles,8%=3
8
jumpinstructions:3cycles,2%=3*2

CPI=(450+510+420+38+3*2)/100=3.6

22
Q

What are the 5 stages of a basic pipeline execution model?

A

Fetch - get the next instruction
Decode - figure out what that instruction is
Execute - perform ALU, or address calc in mem op
Memory - mem access if necessary
WriteBack- write the result back

23
Q

What is control dependence

A

whether or not to execute an instruction or a group of instructions based on control flow conditions (if, else)

24
Q

List three types of Data dependence

A

Read after write
Write after write
Write after Read

25
Q

Other parallelisms in available for computing systems

A

Vector processing
Multithreading, multiprocessing
Micro-SIMD