CMPT 295 Lecture Notes

  1. Course Introduction [“Course Introduction” slides]
    1. This Course [This Course slides]
    2. Grading [Grading slides]
    3. Lectures and Labs [Lectures and Labs slides]
    4. Mini-Project [Mini-Project slides]
    5. Quizzes/Exams [Quizzes/Exams slides]
    6. References [References slides]
    7. Assumptions [Assumptions slides]
    8. Expectations [Expectations slides]
    9. Computer Systems [Computer Systems slides]
    10. Hardware [Hardware slides]
    11. Topics (1) [Topics (1) slides]
  2. Revisiting C [“Revisiting C” slides]
    1. Command Line C [Command Line C slides]
    2. The Heap [The Heap slides]
    3. Multi-file C [Multi-file C slides]
    4. Compiling C [Compiling C slides]
    5. Aside: Integers in C [Aside: Integers in C slides]
  3. Assembly Introduction [“Assembly Introduction” slides]
    1. Our First Assembly [Our First Assembly slides]
    2. Calling Convention [Calling Convention slides]
    3. The Registers [The Registers slides]
    4. Example: call preserving [Example: call preserving slides]
  4. The Processor [“The Processor” slides]
    1. Digital Circuits [Digital Circuits slides]
    2. The Processor [The Processor slides]
    3. Instructions [Instructions slides]
    4. Memory [Memory slides]
    5. Instruction Cycle [Instruction Cycle slides]
    6. Reality [Reality slides]
    7. The Point [The Point slides]
  5. Assembly: Conditions and the Stack [“Assembly: Conditions and the Stack” slides]
    1. Revisiting Commands [Revisiting Commands slides]
    2. Control Flow [Control Flow slides]
    3. Control Example: max [Control Example: max slides]
    4. Conditional Jumps [Conditional Jumps slides]
    5. Control Structures [Control Structures slides]
    6. Status Flags [Status Flags slides]
    7. Aside: Stacks [Aside: Stacks slides]
    8. The Stack [The Stack slides]
    9. Preserving on the Stack [Preserving on the Stack slides]
    10. Local Stack Variables [Local Stack Variables slides]
    11. Recursion [Recursion slides]
    12. Operand Size [Operand Size slides]
  6. Binary Representations [“Binary Representations” slides]
    1. Counting [Counting slides]
    2. Binary Integers [Binary Integers slides]
    3. Binary Arithmetic [Binary Arithmetic slides]
    4. Signed Integers [Signed Integers slides]
    5. Two's Complement [Two's Complement slides]
    6. Adding Two's Complement [Adding Two's Complement slides]
    7. Other Operations [Other Operations slides]
    8. Limits and Overflow [Limits and Overflow slides]
    9. Languages & Limits [Languages & Limits slides]
    10. Hexadecimal [Hexadecimal slides]
    11. Other Data in Binary [Other Data in Binary slides]
    12. Characters [Characters slides]
    13. UTF-8 [UTF-8 slides]
    14. Text [Text slides]
    15. Strings [Strings slides]
    16. Unicode is Complex [Unicode is Complex slides]
  7. Bit Tricks [“Bit Tricks” slides]
    1. Bit Fields [Bit Fields slides]
    2. Testing Bits in Assembly [Testing Bits in Assembly slides]
    3. Multiplying and Dividing [Multiplying and Dividing slides]
    4. Example: count set bits [Example: count set bits slides]
  8. Assembly: Using Memory [“Assembly: Using Memory” slides]
    1. Memory [Memory slides]
    2. Pointers [Pointers slides]
    3. Assembly Code Segments [Assembly Code Segments slides]
    4. Arrays and Memory [Arrays and Memory slides]
    5. Addressing Modes [Addressing Modes slides]
    6. Relative Addressing [Relative Addressing slides]
    7. Local Stack Array [Local Stack Array slides]
    8. Assembly Syntax [Assembly Syntax slides]
  9. Memory & Storage [“Memory & Storage” slides]
    1. Memory [Memory slides]
    2. Cache [Cache slides]
    3. Latency & Bandwidth [Latency & Bandwidth slides]
    4. Memory Hierarchy [Memory Hierarchy slides]
    5. Memory Locality [Memory Locality slides]
    6. Storage [Storage slides]
    7. Network Storage [Network Storage slides]
    8. Virtual Memory [Virtual Memory slides]
    9. Swap [Swap slides]
    10. Disk Cache [Disk Cache slides]
    11. Memory Hierarchy [Memory Hierarchy slides]
  10. Processor Tricks [“Processor Tricks” slides]
    1. The Pipeline [The Pipeline slides]
    2. Data Hazards [Data Hazards slides]
    3. Branch Hazards [Branch Hazards slides]
    4. Branch Predictor [Branch Predictor slides]
    5. Avoiding Branches [Avoiding Branches slides]
    6. Conditional Moves [Conditional Moves slides]
    7. Superscalar Processors [Superscalar Processors slides]
    8. SMT [SMT slides]
    9. Heterogeneous Cores [Heterogeneous Cores slides]
    10. Summary [Summary slides]
  11. Tools [“Tools” slides]
    1. GDB [GDB slides]
    2. Measuring Time [Measuring Time slides]
    3. Timing Commands [Timing Commands slides]
    4. Perf [Perf slides]
    5. Valgrind [Valgrind slides]
    6. Profiling [Profiling slides]
    7. Memory Latency [Memory Latency slides]
    8. Summary [Summary slides]
  12. Floating Point [“Floating Point” slides]
    1. x86 Floating Point [x86 Floating Point slides]
    2. Calling Convention [Calling Convention slides]
    3. FP Instructions [FP Instructions slides]
    4. Fractions in Binary [Fractions in Binary slides]
    5. Representing Fractions [Representing Fractions slides]
    6. IEEE Floating Point [IEEE Floating Point slides]
    7. Representing Values [Representing Values slides]
    8. Sizes of FP [Sizes of FP slides]
    9. Representable Values [Representable Values slides]
    10. Limits of FP [Limits of FP slides]
    11. Compilers and FP [Compilers and FP slides]
  13. Data Parallelism [“Data Parallelism” slides]
    1. SIMD [SIMD slides]
    2. SIMD Instructions [SIMD Instructions slides]
    3. SIMD Performance [SIMD Performance slides]
    4. Vectorclass Library [Vectorclass Library slides]
    5. Summary [Summary slides]
  14. Returning to C
  15. Threads
  16. Leftovers
  17. Conclusion

Course home page. x86-64 Cheat Sheet. Table of Tables.

Schedule

Week Deliverables (*) Lecture Hour Lecture Date First Slide
1 1 Sep 3 Intro
2, 3 Sep 5 Multi-file C
2 Lab 1 4 Sep 10 Example: call preserving
5, 6 Sep 12 The Processor
3 Lab 2 7 Sep 17 Control Flow
8, 9 Sep 19 Status Flags
4 Lab 3 10 Sep 24 Binary Integers
11, 12 Sep 26 Limits and Overflow
5 Lab 4 13 Oct 1 Text
14, 15 Oct 3 Bit Tricks
6 Lab 5 16 Oct 8 Assembly Code Segments
17, 18 Oct 10 no lecture 🦃
7 Quiz 1, Lab 6 19 Oct 15 Addressing Modes
20, 21 Oct 17 Quiz 1
8 Lab 7 22 Oct 22 Memory & Storage
23, 24 Oct 24 Storage
9 Lab 8 25 Oct 29 Avoiding Branches
26, 27 Oct 31 Measuring Time
10 Lab 9 28 Nov 5 FP Instructions
29, 30 Nov 7
11 Quiz 2, Lab 10 31 Nov 12
32, 33 Nov 14 Quiz 2
12 Lab 11 34 Nov 19
35, 36 Nov 21
13 Lab 12 37 Nov 26
38, 39 Nov 28
14+ Mini-Project,
Final Exam		 —

* Check CourSys for the actual due dates and times.

Quiz instruction slide