1. Scoreboarding & Tomasulos Approach Bazat pe slide-urile lui Vincent H. Berk

2. Scoreboarding

3. 3/43 Figure A.51 The basic structure of a DLX processor with a scoreboard Scoreboard Integer unit FP add FP divide FP mult RegistersData buses Control/status Scoreboard

4. 4/43 Four Stages of Scoreboard Control: ISSUE 1.Issue: decode instructions & check for structural hazards (ID1) If a functional unit for the instruction is free and no other active instruction has the same destination register (WAW), the scoreboard issues the instruction to the functional unit and updates its internal data structure. If a structural or WAW hazard exists, then the instruction issue stalls, and no further instructions will issue until these hazards are cleared. Algorithm: Assure In-Order issue Multiple issues per cycle are allowed Check if Destination Register is already reserved for writing (WAW) Check if Read-Operand stage of Functional Unit is free (Structural)

5. 5/43 Four Stages of Scoreboard Control: READ-OPERANDS 2.Read operands: wait until no data hazards, then read operands (ID2) – First Functional Pipeline Stage A source operand is available if no earlier issued active instruction is going to write it, or if the register containing the operand is being written by a currently active functional unit. When the source operands are available, the scoreboard tells the functional unit to proceed to read the operands from the registers and begin execution. The scoreboard resolves RAW hazards dynamically in this step, and instructions may be sent into execution out of order. Algorithm: Wait for operands to become available, Register Result Status (RAW) Operand Caching is allowed Forwarding from another WB stage is allowed

6. 6/43 Four Stages of Scoreboard Control – ex + write 3. Execution: operate on operands (EX) The functional unit begins execution upon receiving operands. When the result is ready, it notifies the scoreboard that it has completed execution. This stage can be (sub-)pipelined. 4. Write result: finish execution (WB) Once the scoreboard is aware that the functional unit has completed execution, the scoreboard checks for WAR hazards. If none, it writes results. If WAR, it stalls the instruction. Algorithm: Delay write until all Rj and Rk fields for this register are marked as either cached or read. If caching of operands is done: forward answer right away. If not, wait until all operands are read before writing. Forward answers to units waiting for this write for their operand.

7. 7/43 Three Parts of the Scoreboard 1.Instruction status Indicates which of 4 steps the instruction is in. 2.Functional unit status Indicates the state of the functional unit (FU). 9 fields for each functional unit Busy – Indicates whether the unit is busy or not Op – Operation to perform in the unit (e.g., + or -) Fi – Destination register Fj, Fk – Source-register numbers Qj, Qk – Functional units producing source registers Fj, Fk Rj, Rk – Flags indicating when Fj, Fk are available and not yet read. (Alternatively: read and cached ) 3.Register result status: Indicates which functional unit will write each register, if one exists. Blank when no pending instructions will write that register.

8. 8/43 Scoreboard Example Cycle 1 R2 has not been read/cached until cycle 2!!!

9. 9/43 Scoreboard Example Cycle 2 Issue 2nd LD or MULT?

10. 10/43 Scoreboard Example Cycle 4 Yes

11. 11/43 Scoreboard Example Cycle 5 SUPERSCALAR: Issue MULTD?

12. 12/43 Scoreboard Example Cycle 6

13. 13/43 Scoreboard Example Cycle 7 Read multiply operands? DIVD could have been issued on this cycle.

14. 14/43 Scoreboard Example Cycle 8a

15. 15/43 Scoreboard Example Cycle 8b

16. 16/43 Scoreboard Example Cycle 9 Issue ADDD?

17. 17/43 Scoreboard Example Cycle 11

18. 18/43 Scoreboard Example Cycle 12

19. 19/43 Scoreboard Example Cycle 13

20. 20/43 Scoreboarding Summary Limitations of CDC 6600 scoreboard No forwarding hardware Limited to instructions in basic block (small window) Small number of functional units (structural hazards), especially integer/load/store units Do not issue if structural or WAW hazards Wait for WAR hazards Imprecise exceptions Key idea: Allow instructions behind stall to proceed Decode issue instructions and read operands Enables out-of-order execution out-of-order completion

21. 21/43 Scoreboarding Summary Modern Day Improvements: All operands are cached as soon as available Forwarding Pipelining Functional Units Microcoding, eg. IA32 (widens execution window) More precise exceptions In order retirement Works best with tons of actual registers Tomasulo approach: Reservation stations vs. Forwarding and Caching Temporary Registers work as many virtual registers

22. Tomasulos Approach

23. 23/43 Hardware Schemes for ILP Key idea: Allow instructions behind stall to proceed Decode => issue instructions and read operands Enables out-of-order execution => out-of-order completion Why in hardware at run time? Works when dependence is not known at run time Simplifies compiler Allows code for one machine to run well on another Out-of-order execution divides ID stage: Issue decode instructions, check for structural hazards Read operands wait until no data hazards, then read operands

24. 24/43 Tomasulos Algorithm For IBM 360/91 about 3 years after CDC 6600 Goal: High performance without special compilers Differences between IBM 360 & CDC 6600 ISA IBM has only 2 register specifiers/instruction vs. 3 in CDC 6600 IBM has 4 FP registers vs. 8 in CDC 6600 Differences between Tomasulos Algorithm & Scoreboard Control & buffers (called reservation stations) distributed with functional units vs. centralized in scoreboard Registers in instructions replaced by pointers to reservation station buffer HW renaming of registers to avoid WAR, WAW hazards Common data bus (CDB) broadcasts results to functional units Load and stores treated as functional units as well Alpha 21264, HP 8000, MIPS 10000, Pentium III, PowerPC 604,...

25. 25/43 Three Stages of Tomasulo Algorithm 1. Issue: Get instruction from FP operation queue If reservation station free, issues instruction & sends operands (renames registers). 2. Execution: Operate on operands (EX) When operands ready then execute; if not ready, watch common data bus for result. 3. Write result: Finish execution (WB) Write on common data bus to all awaiting units; mark reservation station available. Common data bus: data + source (come from bus)

26. 26/43 Tomasulo Organization FP Adders Common data bus (CDB) From Memory FP Registers Load Buffers From Instruction Unit Operand Bus Store Buffers To Memory FP Multipliers FP Op Queue Operation Bus Reservation Stations FP Mul Res. Station FP Add Res. Station

27. 27/43 Reservation Station Components Op – Operation to perform in the unit (e.g., + or – ) Qj, Qk – Reservation stations producing source registers Vj, Vk – Value of source operands Rj, Rk – Flags indicating when Vj, Vk are ready Busy – Indicates reservation station and FU is busy Register result status Indicates which functional unit will write each register, if one exists. Blank when no pending instructions will write that register.

28. 28/43 Tomasulo Example Cycle 1

29. 29/43 ENGS 116 Lecture 8 29 Tomasulo Example Cycle 2

30. 30/43 Tomasulo Example Cycle 3 Register names are renamed in reservation stations Load1 completing who is waiting for Load1?

31. 31/43 Tomasulo Example Cycle 4 Load2 completing who is waiting for it?

32. 32/43 Tomasulo Example Cycle 5

33. 33/43 Tomasulo Example Cycle 6

34. 34/43 Tomasulo Summary Reservation stations: 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 get ahead, beyond branches) Lasting Contributions Dynamic scheduling Register renaming Load/store disambiguation 360/91 descendants are Pentium III; PowerPC 604; MIPS R10000; HP-PA 8000; Alpha 21264

35. 35/43 Tomasulo with Speculation 1. Issue – Empty reservation station and an empty ROB slot. Send operands to reservation station from register file or from ROB. This stage is often referred to as: dispatch 2. Execute – Monitor CDB for operands, check RAW hazards. When both operands are available, then execute. 3. Write Result – When available, write result to CDB through to ROB and any waiting reservation stations. Stores write to value field in ROB. 4. Commit – Three cases: Normal Commit: write registers, in order commit Store: update memory Incorrect branch: flush ROB, reservation stations and restart execution at correct PC

36. 36/43

37. Now, for the grand finale Lets compare!!!

38. 38/43 Figure A.51 The basic structure of a DLX processor with a scoreboard Scoreboard Integer unit FP add FP divide FP mult RegistersData buses Control/status Scoreboard

39. 39/43 Tomasulo Organization FP Adders Common data bus (CDB) From Memory FP Registers Load Buffers From Instruction Unit Operand Bus Store Buffers To Memory FP Multipliers FP Op Queue Operation Bus Reservation Stations FP Mul Res. Station FP Add Res. Station

40. 40/43 Scoreboard Example Cycle 6

41. 41/43 Tomasulo Example – cycle 6

42. 42/43 Differences between Tomasulos Algorithm & Scoreboard Control & buffers (reservation stations) distributed with functional units Registers in instructions replaced by pointers to reservation station buffer HW renaming of registers to avoid WAR, WAW hazards Common data bus (CDB) broadcasts results to functional units Load and stores treated as functional units as well Stages: Issue, Execution, Write result Control & buffers centralized Use actual registers Do not issue if structural or WAW hazards Wait for WAR hazards Forwarding? Stages: Issue, Read operands, Execution, Write result

43. 43/43