In More Depth

• Chapter 1  Computer Abstractions and Technology
  • 1.59 - 1.64: Integrated Circuit Cost (pages IMD 1.8-1 - 1.8-2)
• Chapter 2  Instructions: Language of the Computer
  • 2.8 - 2.9: Bit Fields in C (pages IMD 2.20-1 - 2.20-2)
  • 2.10 - 2.12: Jump Tables (pages IMD 2.20-3 - 2.20-4)
  • 2.16 - 2.18: Tail Recursion (pages IMD 2.20-5 - 2.20-6)
  • 2.45, 2.57 - 2.58: The IBM/Motorola versus MIPS in C (pages IMD 2.20-11 - 2.20-14)
  • 2.52 - 2.53: Instruction Set Styles (pages IMD 2.20-7 - 2.20-9)
  • 2.54 - 2.55: The Single Instruction Computer (page IMD 2.20-10)
  • 2.59: Logical Instructions (page IMD 2.20-15)
• Chapter 3  Arithmetic for Computers
  • 3.23: Booth's Algorithm (pages IMD 3.11-1 - 3.11-5)
  • 3.25 - 3.26: The Power PC’s Multiply-Add Instruction (page IMD 3.11-6)
• Chapter 4  Assessing and Understanding Performance
  • 4.19 - 4.24: Amdahl's Law (pages IMD 4.8-1 - 4.8-2)
  • 4.25 - 4.26: Choosing the Right Mean (pages IMD 4.8-3 - 4.8-5)
  • 4.27 - 4.28: Synthetic Benchmarks (pages IMD 4.8-6 - 4.8-7)
  • 4.29: MIPS, MOPS, and Other FLOPS (pages IMD 4.8-8 - 4.8-9)
  • 4.30 - 4.32: MFLOPS as a Performance Metric (pages IMD 4.8-10 - 4.8-11)
  • 4.33: Embedded Benchmarks (pages IMD 4.8-12 - 4.8-13)
  • 4.34: Using Hardware-Independent Metrics (pages IMD 4.8-14 - 4.8-15)
  • 4.49 - 4.50: The Difficulty with Kernel Benchmarks (pages IMD 4.8-16 - 4.8-17)
• Chapter 7  Large and Fast: Exploiting Memory Hierarchy
  • 7.17 - 7.19: Average Memory Access Time (page IMD 7.10-1)
• Chapter 8  Storage, Networks, and Other Peripherals
  • 8.26: Ethernet Simulation (pages IMD 8.12-1)
  • 8.31 - 8.32: Disk Arrays (page IMD 8.12-2)
• Appendix B  The Basics of Logic Design
  • B.1 - B.2, B.15 - B.16: DeMorgan’s Theorems (page IMD B.14-1)
  • B.31 - B.32: Carry Save Adders (page IMD B.14-2)