CS 3853 Computer Architecture Notes

Table of Contents

• Introduction
• Chapter 1: Fundamentals
• Chapter 1 Figures
• Appendix C, Section 1: Pipelining
• Appendix C, Section 2: Pipeline Hazards
• Appendix C, Section 3: Pipeline Implementation
• Appendix C, Section 4: Exceptions
• Appendix C Figures
• Appendix B, Section 1: Introduction to Memory
• Appendix B, Section 2: Cache Performance
• Appendix B, Section 3: Cache Optimization
• Appendix B, Section 4: Virtual Memory
• Appendix B, Section 5: Virtual Memory Examples
• Appendix B Figures
• Chapter 3, Section 1: Instruction Level Parallelism Concepts
• Chapter 3, Section 2: Compiler Techniques for Exposing ILP
• Chapter 3, Section 3: Advanced Branch Prediction
• Chapter 3, Section 4: Dynamic Scheduling
• Tomasulo Algorithm Activity
• Chapter 3, Section 5: Dynamic Scheduling Algorithm Details
• Chapter 3, Section 6: Hardware-Based Speculation

The next class starts here.
Notes for more than one class in advance of the current class are preliminary.

The notes often have links to figures from the book.
To access these you will need a username and password.
These will be available in class.

---

Back to CS 3853 Homepage

---