Index to Lecture 8

  1. Lecture 8 Outline
  2. Branch Penalty
  3. Delay Slot Filling
  4. Conditional Operations
  5. Branch Prediction
  6. Two Types: Static and Dynamic
  7. Simple Static Prediction
  8. Complex Static Prediction
  9. Simple Dynamic Prediction
  10. Branch Target Buffer
  11. Extended Dynamic Prediction
  12. 2-bit Saturating Counter Predictor
  13. Aliasing
  14. Global History
  15. G-Share Predictor
  16. Verification of Prediction
  17. Parallel Branch Pipelines
  18. Run-Time Profiling
  19. Neural Net/Pattern Table Predictors
  20. Hybrid Predictors
  21. Tournament Predictors
  22. Statistical Hybrids
  23. Trace Cache
  24. Exceptions
  25. Precise Exceptions
  26. Branch Prediction Summary
  27. Instruction Level Parallelism
  28. Superpipelining
  29. Superscalar Origins
  30. Modern Superscalar
  31. Crossing the Threshold
  32. Implications of Multiple Issue
  33. Limits to Superscalar Issue
  34. Maximum ILP
  35. Limits to ILP
  36. Branch Prediction
  37. Limited Registers
  38. Imprecise Alias Analysis
  39. UltraSPARC
  40. PowerPC 601 part 1
  41. PowerPC 601 Part 2
  42. PowerPC 601 Part 3
  43. PowerPC 604 Part 1
  44. PowerPC 604 Part 2
  45. PowerPC 604 Part 3
  46. PPC 970 Part 1
  47. PPC 970 Part 2
  48. PPC 970 Part 3
  49. Pentium III Part 1
  50. Pentium III Part 2
  51. Pentium 4 Part 1
  52. Pentium 4 Part 2
  53. Enhancing ILP with Software
  54. Techniques
  55. Loop Unrolling
  56. Software Pipelining
  57. Global Code Motion
  58. Trace Scheduling
  59. Superblocks
  60. Loop Fusion and Splitting
  61. Loop Nest Reordering
  62. Software ILP Summary

 <BACK  INDEX  NEXT>