CPE AM Tomasulo’s algorithm CPE 631 Lecture 10: Instruction...

•2/14/2005

•Aleksandar Milenkovich •1

CPE 631 Lecture 10: Instruction Level Parallelism andIts Dynamic Exploitation

Aleksandar Milenković, [email protected] and Computer EngineeringUniversity of Alabama in Huntsville

14/02/2005 UAH-CPE631 2

CPE 631AM

Outline

Tomasulo’s algorithm

14/02/2005 UAH-CPE631 3

CPE 631AM

Techniques to exploit parallelism

DH stallsBasic compiler pipeline scheduling (A.2, 4.1)

CH stallsLoop Unrolling (4.1)

WAR and WAW stallsDynamic scheduling with register renaming (3.2)

DH stalls (RAW)Basic dynamic scheduling (A.8)

Control hazard stallsDelayed branches (A.2)

Data hazard (DH) stallsForwarding and bypassing (Section A.2)

Ideal CPI, and D/CH stallsCompiler speculation (4.4)

Ideal CPI and DH stallsSoftware pipelining and trace scheduling (4.3)

Ideal CPI, DH stallsCompiler dependence analysis (4.4)

RAW stalls w. memoryDynamic memory disambiguation (3.2, 3.7)

Data and control stallsSpeculation (3.7)

Ideal CPIIssuing multiple instruction per cycle (3.6)

CH stallsDynamic branch prediction (3.4)

Reduces Technique (Section in the textbook)

Dynamically Scheduled Pipelines

•2/14/2005


14/02/2005 UAH-CPE631 5

CPE 631AM

Scoreboard Limitations

Amount of parallelism among instructions– can we find independent instructions to execute

Number of scoreboard entries– how far ahead the pipeline can look for

independent instructions (we assume a window does not extend beyond a branch)

Number and types of functional units– avoid structural hazards

Presence of antidependences and output dependences– WAR and WAW stalls become more important

14/02/2005 UAH-CPE631 6

CPE 631AM

Tomasulo’s Algorithm

Used in IBM 360/91 FPU (before caches)Goal: high FP performance without special compilersConditions: – Small number of floating point registers (4 in 360) prevented

interesting compiler scheduling of operations– Long memory accesses and long FP delays– This led Tomasulo to try to figure out how to get more

effective registers — renaming in hardware!

Why Study 1966 Computer? The descendants of this have flourished!– Alpha 21264, HP 8000, MIPS 10000, Pentium III, PowerPC

604, …

14/02/2005 UAH-CPE631 7

CPE 631AM

Tomasulo’s Algorithm (cont’d)

Control & buffers distributed with Function Units (FU)– FU buffers called “reservation stations” =>

buffer the operands of instructions waiting to issue;Registers in instructions replaced by values or pointers to reservation stations (RS) => register renaming– avoids WAR, WAW hazards– More reservation stations than registers,

so can do optimizations compilers can’tResults to FU from RS, not through registers, over Common Data Bus that broadcasts results to all FUsLoad and Stores treated as FUs with RSs as wellInteger instructions can go past branches, allowing FP ops beyond basic block in FP queue

14/02/2005 UAH-CPE631 8

CPE 631AM

Tomasulo-based FPU for MIPS

FP addersFP adders

Add1Add2Add3

FP multipliersFP multipliers

Mult1Mult2

From Mem FP Registers

Reservation Stations

Common Data Bus (CDB)

To Mem

FP OpQueue

Load Buffers

Store Buffers

Load1Load2Load3Load4Load5Load6

From Instruction Unit

Store1Store2Store3

•2/14/2005


14/02/2005 UAH-CPE631 9

CPE 631AM

Reservation Station Components

Op: Operation to perform in the unit (e.g., + or –)Vj, Vk: Value of Source operands– Store buffers has V field, result to be stored

Qj, Qk: Reservation stations producing source registers (value to be written)– Note: Qj/Qk=0 => source operand is already available in Vj

/Vk– Store buffers only have Qi for RS producing result

Busy: Indicates reservation station or FU is busy

Register result status—Indicates which functional unit will write each register, if one exists. Blank when no pending instructions that will write that register.

14/02/2005 UAH-CPE631 10

CPE 631AM

Three Stages of Tomasulo Algorithm

1. Issue—get instruction from FP Op Queue– If reservation station free (no structural hazard),

control issues instr & sends operands (renames registers)2. Execute—operate on operands (EX)– When both operands ready then execute;

if not ready, watch Common Data Bus for result3. Write result—finish execution (WB)– Write it on Common Data Bus to all awaiting units;

mark reservation station availableNormal data bus: data + destination (“go to” bus)Common data bus: data + source (“come from” bus)– 64 bits of data + 4 bits of Functional Unit source address– Write if matches expected Functional Unit (produces result)– Does the broadcast

Example speed: 2 clocks for Fl .pt. +,-; 10 for * ; 40 clks for /

14/02/2005 UAH-CPE631 11

CPE 631AM

Tomasulo ExampleInstruction status: Exec Write

Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 Load1 NoLD F2 45+ R3 Load2 NoMULTD F0 F2 F4 Load3 NoSUBD F8 F6 F2DIVD F10 F0 F6ADDD F6 F8 F2

Reservation Stations: S1 S2 RS RSTime Name Busy Op Vj Vk Qj Qk

Add1 NoAdd2 NoAdd3 NoMult1 NoMult2 No

Register result status:Clock F0 F2 F4 F6 F8 F10 F12 ... F300 FU

Clock cycle counter

FU countdown

Instruction stream

3 Load/Buffers

3 FP Adder R.S.2 FP Mult R.S.

14/02/2005 UAH-CPE631 12

CPE 631AM

Tomasulo Example Cycle 1Instruction status: Exec Write

Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 Load1 Yes 34+R2LD F2 45+ R3 Load2 NoMULTD F0 F2 F4 Load3 NoSUBD F8 F6 F2DIVD F10 F0 F6ADDD F6 F8 F2



Register result status:Clock F0 F2 F4 F6 F8 F10 F12 ... F301 FU Load1

•2/14/2005


14/02/2005 UAH-CPE631 13

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 Load1 Yes 34+R2LD F2 45+ R3 2 Load2 Yes 45+R3MULTD F0 F2 F4 Load3 NoSUBD F8 F6 F2DIVD F10 F0 F6ADDD F6 F8 F2



Register result status:Clock F0 F2 F4 F6 F8 F10 F12 ... F302 FU Load2 Load1

Note: Can have multiple loads outstanding

14/02/2005 UAH-CPE631 14

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 3 Load1 Yes 34+R2LD F2 45+ R3 2 Load2 Yes 45+R3MULTD F0 F2 F4 3 Load3 NoSUBD F8 F6 F2DIVD F10 F0 F6ADDD F6 F8 F2


Add1 NoAdd2 NoAdd3 NoMult1 Yes MULTD R(F4) Load2Mult2 No

Register result status:Clock F0 F2 F4 F6 F8 F10 F12 ... F303 FU Mult1 Load2 Load1

• Note: registers names are removed (“renamed”) in Reservation Stations; MULT issued

• Load1 completing; what is waiting for Load1?

14/02/2005 UAH-CPE631 15

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 3 4 Load1 NoLD F2 45+ R3 2 4 Load2 Yes 45+R3MULTD F0 F2 F4 3 Load3 NoSUBD F8 F6 F2 4DIVD F10 F0 F6ADDD F6 F8 F2


Add1 Yes SUBD M(A1) Load2Add2 NoAdd3 NoMult1 Yes MULTD R(F4) Load2Mult2 No

Register result status:Clock F0 F2 F4 F6 F8 F10 F12 ... F304 FU Mult1 Load2 M(A1) Add1

• Load2 completing; what is waiting for Load2? 14/02/2005 UAH-CPE631 16

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 3 4 Load1 NoLD F2 45+ R3 2 4 5 Load2 NoMULTD F0 F2 F4 3 Load3 NoSUBD F8 F6 F2 4DIVD F10 F0 F6 5ADDD F6 F8 F2


2 Add1 Yes SUBD M(A1) M(A2)Add2 NoAdd3 No

10 Mult1 Yes MULTD M(A2) R(F4)Mult2 Yes DIVD M(A1) Mult1

Register result status:Clock F0 F2 F4 F6 F8 F10 F12 ... F305 FU Mult1 M(A2) M(A1) Add1 Mult2

• Timer starts down for Add1, Mult1

•2/14/2005


14/02/2005 UAH-CPE631 17

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 3 4 Load1 NoLD F2 45+ R3 2 4 5 Load2 NoMULTD F0 F2 F4 3 Load3 NoSUBD F8 F6 F2 4DIVD F10 F0 F6 5ADDD F6 F8 F2 6


1 Add1 Yes SUBD M(A1) M(A2)Add2 Yes ADDD M(A2) Add1Add3 No


Register result status:Clock F0 F2 F4 F6 F8 F10 F12 ... F306 FU Mult1 M(A2) Add2 Add1 Mult2

• Issue ADDD here despite name dependency on F6?

14/02/2005 UAH-CPE631 18

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 3 4 Load1 NoLD F2 45+ R3 2 4 5 Load2 NoMULTD F0 F2 F4 3 Load3 NoSUBD F8 F6 F2 4 7DIVD F10 F0 F6 5ADDD F6 F8 F2 6


0 Add1 Yes SUBD M(A1) M(A2)Add2 Yes ADDD M(A2) Add1Add3 No


Register result status:Clock F0 F2 F4 F6 F8 F10 F12 ... F307 FU Mult1 M(A2) Add2 Add1 Mult2

• Add1 (SUBD) completing; what is waiting for it?

14/02/2005 UAH-CPE631 19

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 3 4 Load1 NoLD F2 45+ R3 2 4 5 Load2 NoMULTD F0 F2 F4 3 Load3 NoSUBD F8 F6 F2 4 7 8DIVD F10 F0 F6 5ADDD F6 F8 F2 6


Add1 No2 Add2 Yes ADDD (M-M) M(A2)

Add3 No7 Mult1 Yes MULTD M(A2) R(F4)

Mult2 Yes DIVD M(A1) Mult1

Register result status:Clock F0 F2 F4 F6 F8 F10 F12 ... F308 FU Mult1 M(A2) Add2 (M-M) Mult2

14/02/2005 UAH-CPE631 20

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 3 4 Load1 NoLD F2 45+ R3 2 4 5 Load2 NoMULTD F0 F2 F4 3 Load3 NoSUBD F8 F6 F2 4 7 8DIVD F10 F0 F6 5ADDD F6 F8 F2 6






•2/14/2005


14/02/2005 UAH-CPE631 21

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 3 4 Load1 NoLD F2 45+ R3 2 4 5 Load2 NoMULTD F0 F2 F4 3 Load3 NoSUBD F8 F6 F2 4 7 8DIVD F10 F0 F6 5ADDD F6 F8 F2 6 10






• Add2 (ADDD) completing; what is waiting for it? 14/02/2005 UAH-CPE631 22

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 3 4 Load1 NoLD F2 45+ R3 2 4 5 Load2 NoMULTD F0 F2 F4 3 Load3 NoSUBD F8 F6 F2 4 7 8DIVD F10 F0 F6 5ADDD F6 F8 F2 6 10 11


Add1 NoAdd2 NoAdd3 No


Register result status:Clock F0 F2 F4 F6 F8 F10 F12 ... F3011 FU Mult1 M(A2) (M-M+M(M-M) Mult2

• Write result of ADDD here?• All quick instructions complete in this cycle!

14/02/2005 UAH-CPE631 23

CPE 631AM







14/02/2005 UAH-CPE631 24

CPE 631AM







•2/14/2005


14/02/2005 UAH-CPE631 25

CPE 631AM







14/02/2005 UAH-CPE631 26

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 3 4 Load1 NoLD F2 45+ R3 2 4 5 Load2 NoMULTD F0 F2 F4 3 15 Load3 NoSUBD F8 F6 F2 4 7 8DIVD F10 F0 F6 5ADDD F6 F8 F2 6 10 11





• Mult1 (MULTD) completing; what is waiting for it?

14/02/2005 UAH-CPE631 27

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 3 4 Load1 NoLD F2 45+ R3 2 4 5 Load2 NoMULTD F0 F2 F4 3 15 16 Load3 NoSUBD F8 F6 F2 4 7 8DIVD F10 F0 F6 5ADDD F6 F8 F2 6 10 11


Add1 NoAdd2 NoAdd3 NoMult1 No

40 Mult2 Yes DIVD M*F4 M(A1)

Register result status:Clock F0 F2 F4 F6 F8 F10 F12 ... F3016 FU M*F4 M(A2) (M-M+M(M-M) Mult2

• Just waiting for Mult2 (DIVD) to complete14/02/2005 UAH-CPE631 28

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 3 4 Load1 NoLD F2 45+ R3 2 4 5 Load2 NoMULTD F0 F2 F4 3 15 16 Load3 NoSUBD F8 F6 F2 4 7 8DIVD F10 F0 F6 5ADDD F6 F8 F2 6 10 11





•2/14/2005


14/02/2005 UAH-CPE631 29

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 3 4 Load1 NoLD F2 45+ R3 2 4 5 Load2 NoMULTD F0 F2 F4 3 15 16 Load3 NoSUBD F8 F6 F2 4 7 8DIVD F10 F0 F6 5 56ADDD F6 F8 F2 6 10 11





• Mult2 (DIVD) is completing; what is waiting for it? 14/02/2005 UAH-CPE631 30

CPE 631AM


Instruction j k Issue Comp Result Busy AddressLD F6 34+ R2 1 3 4 Load1 NoLD F2 45+ R3 2 4 5 Load2 NoMULTD F0 F2 F4 3 15 16 Load3 NoSUBD F8 F6 F2 4 7 8DIVD F10 F0 F6 5 56 57ADDD F6 F8 F2 6 10 11


Add1 NoAdd2 NoAdd3 NoMult1 NoMult2 Yes DIVD M*F4 M(A1)

Register result status:Clock F0 F2 F4 F6 F8 F10 F12 ... F3056 FU M*F4 M(A2) (M-M+M(M-M) Result

• Once again: In-order issue, out-of-order execution and out-of-order completion.

14/02/2005 UAH-CPE631 31

CPE 631AM

Tomasulo Drawbacks

Complexity– delays of 360/91, MIPS 10000, Alpha 21264,

IBM PPC 620 in CA:AQA 2/e, but not in silicon!Many associative stores (CDB) at high speedPerformance limited by Common Data Bus– Each CDB must go to multiple functional units ⇒ high capacitance, high wiring density

– Number of functional units that can complete per cycle limited to one!

• Multiple CDBs ⇒ more FU logic for parallel assoc stores

Non-precise interrupts!– We will address this later

14/02/2005 UAH-CPE631 32

CPE 631AM

Tomasulo Loop Example

This time assume Multiply takes 4 clocksAssume 1st load takes 8 clocks (L1 cache miss), 2nd load takes 1 clock (hit)To be clear, will show clocks for SUBI, BNEZ– Reality: integer instructions ahead of Fl. Pt.

InstructionsShow 2 iterations

Loop: LD F0 0(R1)MULTD F4 F0 F2SD F4 0 R1SUBI R1 R1 #8BNEZ R1 Loop

•2/14/2005


14/02/2005 UAH-CPE631 33

CPE 631AM

Loop ExampleInstruction status: Exec Write

ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 Load1 No1 MULTD F4 F0 F2 Load2 No1 SD F4 0 R1 Load3 No2 LD F0 0 R1 Store1 No2 MULTD F4 F0 F2 Store2 No2 SD F4 0 R1 Store3 No

Reservation Stations: S1 S2 RS Time Name Busy Op Vj Vk Qj Qk Code:

Add1 No LD F0 0 R1Add2 No MULTD F4 F0 F2Add3 No SD F4 0 R1Mult1 No SUBI R1 R1 #8Mult2 No BNEZ R1 Loop

Register result statusClock R1 F0 F2 F4 F6 F8 F10 F12 ... F30

0 80 Fu

Added Store Buffers

Value of Register used for address, iteration control

Instruction Loop

Iter-ationCount

14/02/2005 UAH-CPE631 34

CPE 631AM

Loop Example Cycle 1Instruction status: Exec Write

ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 Load1 Yes 80

Load2 NoLoad3 NoStore1 NoStore2 NoStore3 No


Add1 No LD F0 0 R1Add2 No MULTD F4 F0 F2Add3 No SD F4 0 R1Mult1 No SUBI R1 R1 #8Mult2 No BNEZ R1 Loop


1 80 Fu Load1

14/02/2005 UAH-CPE631 35

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 Load1 Yes 801 MULTD F4 F0 F2 2 Load2 No

Load3 NoStore1 NoStore2 NoStore3 No


Add1 No LD F0 0 R1Add2 No MULTD F4 F0 F2Add3 No SD F4 0 R1Mult1 Yes Multd R(F2) Load1 SUBI R1 R1 #8Mult2 No BNEZ R1 Loop


2 80 Fu Load1 Mult1

14/02/2005 UAH-CPE631 36

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 Load1 Yes 801 MULTD F4 F0 F2 2 Load2 No1 SD F4 0 R1 3 Load3 No

Store1 Yes 80 Mult1Store2 NoStore3 No




3 80 Fu Load1 Mult1

Implicit renaming sets up data flow graph

•2/14/2005


14/02/2005 UAH-CPE631 37

CPE 631AM







4 80 Fu Load1 Mult1

14/02/2005 UAH-CPE631 38

CPE 631AM







5 72 Fu Load1 Mult1

14/02/2005 UAH-CPE631 39

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 Load1 Yes 801 MULTD F4 F0 F2 2 Load2 Yes 721 SD F4 0 R1 3 Load3 No2 LD F0 0 R1 6 Store1 Yes 80 Mult1

Store2 NoStore3 No




6 72 Fu Load2 Mult1

14/02/2005 UAH-CPE631 40

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 Load1 Yes 801 MULTD F4 F0 F2 2 Load2 Yes 721 SD F4 0 R1 3 Load3 No2 LD F0 0 R1 6 Store1 Yes 80 Mult12 MULTD F4 F0 F2 7 Store2 No

Store3 No


Add1 No LD F0 0 R1Add2 No MULTD F4 F0 F2Add3 No SD F4 0 R1Mult1 Yes Multd R(F2) Load1 SUBI R1 R1 #8Mult2 Yes Multd R(F2) Load2 BNEZ R1 Loop


7 72 Fu Load2 Mult2

•2/14/2005


14/02/2005 UAH-CPE631 41

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 Load1 Yes 801 MULTD F4 F0 F2 2 Load2 Yes 721 SD F4 0 R1 3 Load3 No2 LD F0 0 R1 6 Store1 Yes 80 Mult12 MULTD F4 F0 F2 7 Store2 Yes 72 Mult22 SD F4 0 R1 8 Store3 No




8 72 Fu Load2 Mult2

14/02/2005 UAH-CPE631 42

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 9 Load1 Yes 801 MULTD F4 F0 F2 2 Load2 Yes 721 SD F4 0 R1 3 Load3 No2 LD F0 0 R1 6 Store1 Yes 80 Mult12 MULTD F4 F0 F2 7 Store2 Yes 72 Mult22 SD F4 0 R1 8 Store3 No




9 72 Fu Load2 Mult2

14/02/2005 UAH-CPE631 43

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 9 10 Load1 No1 MULTD F4 F0 F2 2 Load2 Yes 721 SD F4 0 R1 3 Load3 No2 LD F0 0 R1 6 10 Store1 Yes 80 Mult12 MULTD F4 F0 F2 7 Store2 Yes 72 Mult22 SD F4 0 R1 8 Store3 No


Add1 No LD F0 0 R1Add2 No MULTD F4 F0 F2Add3 No SD F4 0 R1

4 Mult1 Yes Multd M[80] R(F2) SUBI R1 R1 #8Mult2 Yes Multd R(F2) Load2 BNEZ R1 Loop


10 64 Fu Load2 Mult2

14/02/2005 UAH-CPE631 44

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 9 10 Load1 No1 MULTD F4 F0 F2 2 Load2 No1 SD F4 0 R1 3 Load3 Yes 642 LD F0 0 R1 6 10 11 Store1 Yes 80 Mult12 MULTD F4 F0 F2 7 Store2 Yes 72 Mult22 SD F4 0 R1 8 Store3 No



3 Mult1 Yes Multd M[80] R(F2) SUBI R1 R1 #84 Mult2 Yes Multd M[72] R(F2) BNEZ R1 Loop



•2/14/2005


14/02/2005 UAH-CPE631 45

CPE 631AM








14/02/2005 UAH-CPE631 46

CPE 631AM








14/02/2005 UAH-CPE631 47

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 9 10 Load1 No1 MULTD F4 F0 F2 2 14 Load2 No1 SD F4 0 R1 3 Load3 Yes 642 LD F0 0 R1 6 10 11 Store1 Yes 80 Mult12 MULTD F4 F0 F2 7 Store2 Yes 72 Mult22 SD F4 0 R1 8 Store3 No






14/02/2005 UAH-CPE631 48

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 9 10 Load1 No1 MULTD F4 F0 F2 2 14 15 Load2 No1 SD F4 0 R1 3 Load3 Yes 642 LD F0 0 R1 6 10 11 Store1 Yes 80 [80]*R22 MULTD F4 F0 F2 7 15 Store2 Yes 72 Mult22 SD F4 0 R1 8 Store3 No


Add1 No LD F0 0 R1Add2 No MULTD F4 F0 F2Add3 No SD F4 0 R1Mult1 No SUBI R1 R1 #8

0 Mult2 Yes Multd M[72] R(F2) BNEZ R1 Loop



•2/14/2005


14/02/2005 UAH-CPE631 49

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 9 10 Load1 No1 MULTD F4 F0 F2 2 14 15 Load2 No1 SD F4 0 R1 3 Load3 Yes 642 LD F0 0 R1 6 10 11 Store1 Yes 80 [80]*R22 MULTD F4 F0 F2 7 15 16 Store2 Yes 72 [72]*R22 SD F4 0 R1 8 Store3 No



4 Mult1 Yes Multd R(F2) Load3 SUBI R1 R1 #8Mult2 No BNEZ R1 Loop



14/02/2005 UAH-CPE631 50

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 9 10 Load1 No1 MULTD F4 F0 F2 2 14 15 Load2 No1 SD F4 0 R1 3 Load3 Yes 642 LD F0 0 R1 6 10 11 Store1 Yes 80 [80]*R22 MULTD F4 F0 F2 7 15 16 Store2 Yes 72 [72]*R22 SD F4 0 R1 8 Store3 Yes 64 Mult1





14/02/2005 UAH-CPE631 51

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 9 10 Load1 No1 MULTD F4 F0 F2 2 14 15 Load2 No1 SD F4 0 R1 3 18 Load3 Yes 642 LD F0 0 R1 6 10 11 Store1 Yes 80 [80]*R22 MULTD F4 F0 F2 7 15 16 Store2 Yes 72 [72]*R22 SD F4 0 R1 8 Store3 Yes 64 Mult1





14/02/2005 UAH-CPE631 52

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 9 10 Load1 No1 MULTD F4 F0 F2 2 14 15 Load2 No1 SD F4 0 R1 3 18 19 Load3 Yes 642 LD F0 0 R1 6 10 11 Store1 No2 MULTD F4 F0 F2 7 15 16 Store2 Yes 72 [72]*R22 SD F4 0 R1 8 19 Store3 Yes 64 Mult1





•2/14/2005


14/02/2005 UAH-CPE631 53

CPE 631AM


ITER Instruction j k Issue CompResult Busy Addr Fu1 LD F0 0 R1 1 9 10 Load1 Yes 561 MULTD F4 F0 F2 2 14 15 Load2 No1 SD F4 0 R1 3 18 19 Load3 Yes 642 LD F0 0 R1 6 10 11 Store1 No2 MULTD F4 F0 F2 7 15 16 Store2 No2 SD F4 0 R1 8 19 20 Store3 Yes 64 Mult1





• Once again: In-order issue, out-of-order execution and out-of-order completion. 14/02/2005 UAH-CPE631 54

CPE 631AM

Why can Tomasulo overlap iterations of loops?

Register renaming– Multiple iterations use different physical

destinations for registers (dynamic loop unrolling)Reservation stations – Permit instruction issue to advance past integer

control flow operations– Also buffer old values of registers - totally avoiding

the WAR stall that we saw in the scoreboardOther perspective: Tomasulo building data flow dependency graph on the fly

14/02/2005 UAH-CPE631 55

CPE 631AM

Tomasulo’s scheme offers 2 major advantages

(1) the distribution of the hazard detection logic– distributed reservation stations and the CDB– If multiple instructions waiting on single result, &

each instruction has other operand, then instructions can be released simultaneously by broadcast on CDB

– If a centralized register file were used, the units would have to read their results from the registers when register buses are available.

(2) the elimination of stalls for WAW and WAR hazards

14/02/2005 UAH-CPE631 56

CPE 631AM

What about Precise Interrupts?

Tomasulo had:In-order issue, out-of-order execution, and out-of-order completionNeed to “fix” the out-of-order completion aspect so that we can find precise breakpoint in instruction stream

•2/14/2005


14/02/2005 UAH-CPE631 57

CPE 631AM

Relationship between precise interrupts and speculation

Speculation is a form of guessingImportant for branch prediction:– Need to “take our best shot” at predicting branch

directionIf we speculate and are wrong, need to back up and restart execution to point at which we predicted incorrectly:– This is exactly same as precise exceptions!

Technique for both precise interrupts/exceptions and speculation: in-order completion or commit

14/02/2005 UAH-CPE631 58

CPE 631AM

HW support for precise interrupts

Need HW buffer for results of uncommitted instructions: reorder buffer– 3 fields: instr, destination, value– Use reorder buffer number instead of reservation station

when execution completes– Supplies operands between

execution complete & commit– (Reorder buffer can be operand source

=> more registers like RS)– Instructions commit– Once instruction commits,

result is put into register– As a result, easy to undo

speculated instructions on mispredicted branches or exceptions

ReorderBuffer

FPOp

Queue

FP Adder FP Adder

Res Stations Res Stations

FP Regs

14/02/2005 UAH-CPE631 59

CPE 631AM

Four Steps of Speculative TomasuloAlgorithm

1. Issue—get instruction from FP Op Queue– If reservation station and reorder buffer slot free, issue instr &

send operands & reorder buffer no. for destination (this stage sometimes called “dispatch”)

2. Execution—operate on operands (EX)– When both operands ready then execute; if not ready, watch

CDB for result; when both in reservation station, execute; checks RAW (sometimes called “issue”)

3. Write result—finish execution (WB)– Write on Common Data Bus to all awaiting FUs

& reorder buffer; mark reservation station available.4. Commit—update register with reorder result– When instr. at head of reorder buffer & result present, update

register with result (or store to memory) and remove instr from reorder buffer. Mispredicted branch flushes reorder buffer (sometimes called “graduation”)

14/02/2005 UAH-CPE631 60

CPE 631AM

What are the hardware complexities with reorder buffer (ROB)?

How do you find the latest version of a register?– (As specified by Smith paper) need associative comparison network– Could use future file or just use the register result status buffer to track which

specific reorder buffer has received the valueNeed as many ports on ROB as register file

ReorderBuffer

FPOp

Queue

FP Adder FP Adder

Res Stations Res Stations

FP Regs

Compar network

Reorder Table

Des

t Re

g

Resu

lt

Exce

ptions

?

Valid

Prog

ram C

ount

er

•2/14/2005


14/02/2005 UAH-CPE631 61

CPE 631AM

Summary

Reservations stations: implicit register renaming to larger set of registers + buffering source operands– Prevents registers as bottleneck– Avoids WAR, WAW hazards of Scoreboard– Allows loop unrolling in HW

Not limited to basic blocks (integer units gets ahead, beyond branches)Today, helps cache misses as well– Don’t stall for L1 Data cache miss (insufficient ILP for L2 miss?)

Lasting Contributions– Dynamic scheduling– Register renaming– Load/store disambiguation

360/91 descendants are Pentium III; PowerPC 604; MIPS R10000; HP-PA 8000; Alpha 21264

CPE AM Tomasulo’s algorithm CPE 631 Lecture 10: Instruction...

Documents

Transcript of CPE AM Tomasulo’s algorithm CPE 631 Lecture 10: Instruction...