1. Microprocessors Introduction to ia64 Architecture Jan 31st, 2002 General Principles

2. Instruction Level Parallelism Certain instructions can be executed in parallel Certain instructions can be executed in parallel Certain instructions can be executed in any order Certain instructions can be executed in any order Both of these stem from lack of dependency between instructions. Both of these stem from lack of dependency between instructions. The goal of the ia64 design: The goal of the ia64 design: Exploit ILP more effectively Exploit ILP more effectively

3. EPIC Explicitly Parallel Instruction Computing Explicitly Parallel Instruction Computing Conventional RISC Conventional RISC Processor discovers and exploits ILP Processor discovers and exploits ILP Conventional VLIW Conventional VLIW Programmer knows the precise execution model and explicitly lays out the program to take advantage of ILP Programmer knows the precise execution model and explicitly lays out the program to take advantage of ILP EPIC EPIC Programmer indicates possible ILP, processor does the rest of the job. Programmer indicates possible ILP, processor does the rest of the job.

4. The ia64 Architecture Instructions are bundled in packets of 3 Instructions are bundled in packets of 3 Packet length is 128 bits Packet length is 128 bits Three 41-bit instructions in each packet Three 41-bit instructions in each packet 5-bits of scheduling information 5-bits of scheduling information Scheduling information indicates Scheduling information indicates What functional units required for each instruction in the packet. What functional units required for each instruction in the packet. What instructions can be executed in parallel What instructions can be executed in parallel

5. Instruction Bundles An instruction bundle is a group of instructions that can be executed in parallel An instruction bundle is a group of instructions that can be executed in parallel No read after write dependencies No read after write dependencies That’s where one instruction writes a value to memory or a register that is read by another instruction. That’s where one instruction writes a value to memory or a register that is read by another instruction. No write after write dependencies No write after write dependencies That’s where two instructions write the same register or location in memory That’s where two instructions write the same register or location in memory

6. More on Bundles The scheduling bits indicate the length of a particular instruction bundle The scheduling bits indicate the length of a particular instruction bundle At one extreme, one instruction per bundle, no parallelism, works but slow! At one extreme, one instruction per bundle, no parallelism, works but slow! At the other extreme, can join packets together to make bundles of arbitrary length At the other extreme, can join packets together to make bundles of arbitrary length Compiler is supposed to construct bundles as big as possible, but does not otherwise have to worry about latencies for correctness. Compiler is supposed to construct bundles as big as possible, but does not otherwise have to worry about latencies for correctness.

7. Bundles and MP Versions Versions of the ia64 implementation may differ in their capabilities of executing instructions in parallel. Versions of the ia64 implementation may differ in their capabilities of executing instructions in parallel. If a bundle is larger than what the implementation can handle, it just breaks it up into pieces done sequentially If a bundle is larger than what the implementation can handle, it just breaks it up into pieces done sequentially Unlike VLIW, or even conventional RISC, no need to recompile for new versions of processors. Unlike VLIW, or even conventional RISC, no need to recompile for new versions of processors.

8. Bundles and Jumps A jump can dynamically end a bundle A jump can dynamically end a bundle First jump to take ends bundle dynamically First jump to take ends bundle dynamically So it is permissible to have multiple jumps in one bundle. Processor takes care of this. So it is permissible to have multiple jumps in one bundle. Processor takes care of this.

9. The Compiler and Bundles The compiler needs to do an analysis to find ILP to construct the largest possible bundles. The compiler needs to do an analysis to find ILP to construct the largest possible bundles. In some cases, this may entail predication, trace scheduling, speculative execution etc In some cases, this may entail predication, trace scheduling, speculative execution etc These can all be done as much as the compiler wants, but are not required. These can all be done as much as the compiler wants, but are not required.

10. Speculative Execution, Predication All instructions are predicated All instructions are predicated Large number of predicate registers Large number of predicate registers Instruction effective only if predicated Instruction effective only if predicated Allows larger bundles Allows larger bundles For example, can have all instructions of both the then and else branches of an IF statement in a single bundle with only the relevant branch being actually executed For example, can have all instructions of both the then and else branches of an IF statement in a single bundle with only the relevant branch being actually executed

11. Speculative Execution, Propagation If instructions are executed speculatively, i.e. you don’t know if they should be executed or not, some instruction may give a garbage value (e.g. divide by zero) If instructions are executed speculatively, i.e. you don’t know if they should be executed or not, some instruction may give a garbage value (e.g. divide by zero) Don’t want a trap, since perhaps we will find out in a moment that we should discard the whole thread. Don’t want a trap, since perhaps we will find out in a moment that we should discard the whole thread. Therefore, must silently propagate indication of bad value (not a value). Therefore, must silently propagate indication of bad value (not a value).

12. Speculative Execution, Loads Loads can cause pipeline stalls Loads can cause pipeline stalls Therefore you want to do them early Therefore you want to do them early But danger in moving them across stores But danger in moving them across stores So there is a load-predict instruction So there is a load-predict instruction Please load this value, I think I will need it Please load this value, I think I will need it And a load confirm instruction And a load confirm instruction OK, now I want that value, check no one stored there since my load predict. If so, too bad you will have to go load it now. OK, now I want that value, check no one stored there since my load predict. If so, too bad you will have to go load it now.

13. Lots and Lots of Registers The ia64 has hundreds of user level registers. The ia64 has hundreds of user level registers. Easier to do speculative execution in registers Easier to do speculative execution in registers As usual, we hate loads, so avoid them As usual, we hate loads, so avoid them Instructions not limited to 32 bits, so we can afford long register identifier fields. Instructions not limited to 32 bits, so we can afford long register identifier fields.

14. Register Windows Register windows are provided Register windows are provided Like the SPARC, except that you can say how much to move the window by Like the SPARC, except that you can say how much to move the window by Overlap between caller and callee possible as on the SPARC Overlap between caller and callee possible as on the SPARC But if you only need a few registers you don’t need to consume a large fixed chunk of registers. But if you only need a few registers you don’t need to consume a large fixed chunk of registers. (old idea, AMD29K had a similar design) (old idea, AMD29K had a similar design)

15. Efficient Code for Loops Suppose we have a loop whose form is Suppose we have a loop whose form is Load value Load value Add some constant to that value Add some constant to that value Store result Store result That’s nasty for dependencies That’s nasty for dependencies We want space between the load and the add We want space between the load and the add And space beween the add and the store And space beween the add and the store

16. Loop Unrolling and Software Pipelining If we unroll several iterations of the loop we can be doing an add of previous iteration while loading the next If we unroll several iterations of the loop we can be doing an add of previous iteration while loading the next Generates much more code Generates much more code Requires complex prolog (get things started) and epilog (finish things off) code Requires complex prolog (get things started) and epilog (finish things off) code In practice, hard to apply in all cases In practice, hard to apply in all cases

17. Rotating Registers Suppose we generate code for the loop Suppose we generate code for the loop Load register R7 with input value Load register R7 with input value Add constant to register R8 Add constant to register R8 Store register R9 to memory Store register R9 to memory Certainly no dependencies Certainly no dependencies But code looks wrong and useless! But code looks wrong and useless! How can we make the above make sense How can we make the above make sense

18. More on Rotating Registers Here is the code Here is the code Load register R7 with input value Load register R7 with input value Add constant to register R8 Add constant to register R8 Store register R9 to memory Store register R9 to memory Now renumber registers on each loop Now renumber registers on each loop Old R7 is new R8 Old R7 is new R8 Old R8 is new R9 Old R8 is new R9 Old R9 is new R7 Old R9 is new R7 Ah ha! Magic, the generated code is OK! Ah ha! Magic, the generated code is OK!

19. More on Rotating Registers Limited subsets of registers can rotate Limited subsets of registers can rotate Giving the renumbering on previous slide Giving the renumbering on previous slide The loop instruction automatically triggers the rotation (a bit like registers windows) The loop instruction automatically triggers the rotation (a bit like registers windows) Special prolog/epilog counts deal with setup and cleanup cases Special prolog/epilog counts deal with setup and cleanup cases Voila! Efficient loops without Voila! Efficient loops without Loop unrolling Loop unrolling Software pipelining Software pipelining

20. The Bottom Line The advantages of VLIW The advantages of VLIW Greater ILP exploitation Greater ILP exploitation Simpler hardware Simpler hardware Without the disadvantages Without the disadvantages Code does not depend on processor model Code does not depend on processor model But But We still depend on the compiler a whole lot! We still depend on the compiler a whole lot! Next time: Details of the ia64 architecture Next time: Details of the ia64 architecture