CSE142: Computer Architecture: Software Perspective (2025 Summer Session 2)

In-person Lecture: MTuWTh 2:00p – 3:20p @ WLH 2204
Youtube Channel: https://www.youtube.com/profusagi
Discussion session: F 12p-1:50p @ WLH 2204

Schedule and SlidesAssignmentsLogisticsCurrent Grade

Instructor

Hung-Wei Tseng
email: htseng @ ucsd.edu
Office Hours: WTh 3:30p-4:30p @ CSE 2210
Online Office Hour: Th 9:30p-10:30p @ Zoom Office Hour Link (in Google Calendar)

Teaching Assistant & Tutors

Hongyuan Jia and Andrew Lu
email: cse142_su25 @ escalab.org
Office Hours: Please check the calendar

Other important links

Quizzes, Assignments: Gradescope
Discussion Forum on Piazza: https://piazza.com/class/md99z1w7qks3cb#
YouTube Channel: https://www.youtube.com/profusagi
Check grades: https://www.escalab.org/my_grades/

Course Overview

This course will describe the basics of modern processor operation. Topics include computer system performance, instruction set architectures, pipelining, branch prediction, memory-hierarchy design, and a brief introduction to multiprocessor architecture issues. This course is taught in tandem with CSE142L: Software Projects of Computer Architecture (2025 Summer Session II). Please be aware this is the last quarter CSE142L is offered. If this is required in your graduation criteria, you should consider take CSE142L.

Text books

Required:

Grading

  • The final grading is determined by the average of the following criteria (each accounts for 33.33%).
    • Assignments
      • Assignments will be assigned throughout the course. We will drop your lowest one.
      • You’re strongly encouraged to watch this video before you start
      • Our assignments will be based on Jupyterhub/Jupyter notebooks — everyone is supposed to have a unique turnin. There is no group submission or collaboration allowed.
      • There is no regrading on assignments except for obvious grading errors. Please make sure your answers are clearly comprehensible to our autograders and follow the guideline of answering assignment questions.
      • Peer instruction/Participation
        • This class uses “peer instruction” as our teaching method
        • To encourage your participation in peer instructions, we count your participation in peer instructions throughout the summer session as one assignment.
        • If you opt out from peer instructions, this one will become the one that is dropped from your assignments.
        • To participate in peer instructions, we require each of you to download poll everywhere App or navigate/login to their website during the class if you would like to earn credits from participating in peer instructions.
        • You must login with @ucsd.edu account. If you didn’t do it right, you won’t get credits.
        • You need to answer 50% of the poll questions to receive full credits on peer instructions.
    • Reading Quizzes
      • We will have reading quizzes on GradeScope
      • Only one shot, but time unlimited. We will drop your lowest two quizzes as well.
    • Midterms & Final
      • Midterms and Final weight equally the same in this category
      • The final will be cumulative.
  • Additional notes about grades in this course
    • Your score will be available https://www.escalab.org/my_grades/. Your final grade is the weighted average of these grades.
      We do our best to record grades accurately, but you should double-check.
    • Late submission: We do not accept any late submission, including quiz, assignments, projects.
    • Errors in grading: If you feel there has been an error in how an assignment or test was graded, you have 3 days from when the assignment is return to bring it to our attention. You must submit (via email to the instructor and the appropriate TAs) a written description of the problem through gradescope. Neither I nor the TAs will discuss regrades without receiving a gradescope request from you about it first.
    • For midterm and final: We do not regrade on a single problem. We will re-grade your whole test. The 3-day regrading window still applies.
    • Final grades: If you have a problem with your final grade in the course, send me email and we can set up an appointment to discuss it.

Schedule and Slides


Topic Reading Slides
(Preview)
Slides (Release) Due Note
08/04/2025Introduction: the Big Picture of ComputersP&H 1.1-1.5, 2.1 – 2.5, 2.12, 2.14, 2.17, 2.18, 2.19, 2.20, 2.21
(1) Introduction to CSE142

Demos: Myths about computer architecture


08/05/2025Performance: What does “Perfect” mean?P&H 1.6
x86-64 Machine-Level Programming
Performance (Preview)(2) Performance (1): What is “perfect”

Demo: Is “FLOPS” a meaningful metric?
Reading quiz for P&H 1.6
due before class
Assignment #1 Released
08/06/2025Performance (II): What can make things perfect?(3) Performance (2): What changes

Demo: Who affects the performance?

08/07/2025Performance (III): Amdahl’s Law and its implicationsO&B 1.9.1(4) Performance (3): What’s the one thing right?

Demo: Amdahl’s Law & It’s implications
Reading quiz for O&B 1.9.1 due before class

Assignment #1 due 8/10 midnight

08/11/2025Memory Hierarchy (I): Inside Out of Memory HierarchyO&B 6.2, 6.3Memory (Preview)(5) Memory (1): Inside out & Memory Hierarchy

Demo: Locality in matrix-vector multiplications (fully-connected)
Reading quiz for O&B 6.2, 6.3, 6.4Assignment #2 released
08/12/2025Memory Hierarchy (II): The A, B, Cs of cachesO&B 6.4(6) Memory (2): The A, B, Cs of caches

Demo: The memory hierarchy of my processors
08/13/2025Memory Hierarchy (III): Causes and remedies of cache misses (7) Memory (3): Cache misses and how to address them

Demo: cache misses in Intel Core i7 & NV Tegra Orin

Demo: column-store vs. row-store

Demo: loop optimizations
Reading quiz for O&B 6.5, 9.1, 9.2, 9.3, 9.6
08/14/2025Memory Hierarchy (IV)O&B 6.5(8) Memory (4): Case study: matrix multiplications

Demo: Optimizing Matrix Multiplications
Assignment #2 due 8/17 midnight
08/18/2025–08/21/2025Midterm @ Triton Testing CenterMaterials cover up to 8/14/2025 (included)Please schedule through https://us.prairietest.com/

You may find the Midterm Review video helpful
08/18/2025Virtual MemoryO&B , 9.1, 9.2, 9.3, 9.6Virtual Memory (Preview)(9) Virtual Memory: Just an illusion

Demo: Virtual Memory
Assignment #3 Release
08/19/2025Modern Processor Design (I)O&B 4.4, 4.5, P&H 4.6Basic Processor Design (Preview)(10) Basic Processor Design: the Pipeline

Demo: tricky C != fast C
Reading quiz for O&B 4.4 & 4.5 and P&H 4.6 & 4.9
08/20/2025Modern Processor Design (II)P&H 4.9 (11) Dynamic Branch Prediction

Demo: the effect of branch predictions
Assignment #3 due 8/24 midnight
08/21/2025Modern Processor Design (III)O&B 5.7, P&H 4.11Data hazards & Dynamic OoO execution
(Preview)
(12) Dynamic instruction scheduling

Demo: loop unrolling
Reading quiz for O&B 5.7, P&H 4.11

Assignment #4 released

08/25/2025No lecture:
Hiatus after midterm
08/26/2025Modern Processor Design (IV)(13) OoO/SuperScalar

Demo: linked list vs. array

08/27/2025Programming on Modern ProcessorsP&H 6.1-6.5(14) Programming on Modern Processors & SMT

Demo: popcount
Reading quiz for P&H 5.10. 6.1-6.5 & O&B 12.1 & 12.3
08/28/2025Parallel architectures and parallel programming O&B 12.1 & 12.3(15) Parallel Architecture & Parallel Programming

Demo: multithreaded programming
Assignment #4 due 8/31 midnight
09/01/2025Labor Day
09/02/2025Dark Silicon ProblemP&H 6.6Golden Age of Computer Architecture (Preview)(16) Dark Silicon Problem

Demo: power vs. energy

Demo: big.LITTLE
Reading quiz for P&H 6.6-6.7
09/03/2025Dark silicon and the future of parallel, domain-specific architecturesP&H 6.7
(17) The new golden age of computer architecture

Demo: Edge TPUs vs. CPUs

Demo: GPTPU

09/04/2025Final Review(18) Final ReviewAssignment #5 due 9/5 midnight
09/05/2025Final Exam @ Triton Testing Center at 10a, 12p, or 2p

Assignments

Please watch https://youtu.be/7PTzdq3l4E4 before you start!

Integrity Policies

  • Cheating WILL be taken seriously. Doing otherwise is not fair to honest students. It is also not fair to allow the cheater to think that it is a reasonable alternative in life.
  • Please review the UCSD student handbook for more details on Academic Integrity.
  • Anyone copying information or having information copied during a test will receive an F for the class and will not be allowed to drop. They will be reported to their college dean. If you can prove non-cooperative copying took place, your grade may be restored, but you must prove it to the dean–I don’t want to be involved. Anyone caught cheating or falsely representing the work of others on the homework will not be allowed to turn in further homework. Your grade will be based exclusively on the tests with a penalty of 25% OR GREATER applied.
  • We photocopy a random sampling of the exams in order to ensure that students do not modify their tests after they have been returned.
  • Online solutions, etc.: A solutions manual exists for this text. Using it, or any solutions you may find on the internet elsewhere IS CHEATING and will be dealt with accordingly. We know what the solution manual solutions look like. Homework is a small fraction of your grade, so cheating on it is unproductive.