CSE141: Introduction to Computer Architecture
|
When & Where Pepper Canyon Hall 120 Lecture: MW 8:00a - 9:20a, 9:30a-10:50a Discussion Section: Instructor Hung-Wei Tseng Teaching Assistants
Harish Prasanth Calendar URL http://goo.gl/JJyrXp. This is just a reference for office hours. You should check Schedule and Slides for more details. | |
|
Course Discussion Board TritonEd. Required reading. Get signed up.
Podcasting |
|
Course Description
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
CSE141L.
Unless you have discussed it with you me, you should be in enrolled in both.
Text books
Required: Patterson & Hennessy,
Computer Organization and Design: The Hardware/Software Interface, Patterson & Hennessy, Morgan Kaufmann,
5th Edition
Required: Other assigned readings throughout the quarter.
Optional: The History of Computing This a great set of lectures from a course taught at UCSD/UW/Berkeley three years ago. Most of them are by the folks that actually made the history (Steve Wozniak, Ray Ozzie, Gordon Bell, etc.)
Grading
Homework 15%
Homeworks will be assigned throughout the course.
Class participation 9% (Clicker-based)
We will be using clickers in the class!
Class participation 1% (Bonus)
Reading Quizzes 15%
We will have reading quizzes on TritonEd!
Midterm 25%
Final 35%
The final will be cumulative.
Additional notes about grades in this course:
•Your score will be available on TritonEd. Your final grade is the weighted average of these grades.
We do our best to record grades accurately, but you should double-check.
•Errors in grading If you feel there has been an error in how an assignment or test was graded, you have one week 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. Neither I nor the TAs will discuss regrades without receiving an email from you about it first.
For arithmetic errors (adding up points etc.) you do not need to submit anything in writing, but the one week limit still applies.
•For midterm and final, we do not regrade on a single
problem. We will re-grade your whole test.
•Final grades If you have a problem with your final grade in the course, send me email and we can set up an appoinment to discuss it.
| Date | Topic | Readings | Pre-release slides | Slides | Due | Notes |
| 2019/08/05 (8a) | Introduction & ISA | ISA (Preview) | Introduction | Demo | ||
| 2019/08/05 (9:30a) | ISA | 2.1-2.7, 2.10, 2.8, 2.12, 2.13, 2.14 and 2.17 | ISA | Demo | ||
| 2019/08/07 (8a) | x86/Performance Evaluation | 1.5-1.10 | Performance (Preview) | x86 & Performance (I) | Reading quizzes for 1.5-1.10 due before class | |
| 2019/08/07 (9:30a) | Performance Evaluation (II) | Performance (II) | Demo | |||
| 2019/08/12 (8a) | Performance (III) and Single-cycle Processor Design | 4.1-4.4 | Processor Design (Preview) | Performance (III)/Power/Energy | Homework 1 due before
class Reading quizzes for 4.1-4.9 due before class |
Demo |
| 2019/08/12 (9:30a) | Pipeline processor | 4.5-4.9 | Processor Design (I) | |||
| 2019/08/14 (8a) | Pipeline Processor (II) -- Structure/Data Hazards | Processor Design (II) | ||||
| 2019/08/14 (9:30a) | Pipeline (III) -- Control Hazard/Branch Prediction | Processor Design (III) | Demo | |||
| 2019/08/19 (8a) | Branch Prediction & Memory Hierarchy | 5.1-5.4 | Memory Hierarchy (Preview) | Processor Design (IV) & Memory Hierarchy | Homework 2 due before class Reading quizzes for 5.1-5.4 due before class |
|
| 2019/08/19 (9:30a) | Midterm Review | Midterm Review | ||||
| 2019/08/21 (8a) | Midterm | |||||
| 2019/08/21 (9:30a) | Memory hierarchy | 5.1-5.4 | Memory Hierarchy (2) | Demo | ||
| 2019/08/26 (8a) | Memory and caching | 5.1-5.4 | Memory Hierarchy (3) | Homework 3 due Reading quizzes for 5.7 due before class |
Demo | |
| 2019/08/26 (9:30a) | Virtual Memory | 5.7 | Virtual Memory (Preview) | Virtual Memory | Reading quizzes for 4.10, 5.10 and 6.4-6.5 due before class | Demo |
| 2019/08/28 (8a) | Modern Processor Design | 4.10 | Modern Processor Architecture (I) | Reading quizzes for 4.10, 5.10 and 6.4-6.5 due before class | ||
| 2019/08/28 (9:30a) | Introduction to multithreaded processors (I) | 6.4-6.5 | Multithreaded Processors (Preview) | Modern Processor Architecture (II) | Demo | |
| 2019/09/04 (8a) | Introduction to multithreaded processors (II) | 6.4-6.5 | Parallel Architectures/Programming | Parallel Architectures/Programming | Demo | |
| 2019/09/04 (9:30a) | Final Review | Final Review | ||||
| 2019/09/07 (8a) | Final |
Integrity Policy
Cheating WILL be taken seriously. Doing otherwise is not fair to honest students. It is also not fair to allow the cheater to thing 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.