Computer Science 252: Graduate Computer Architecture (4 units)Professor John Kubiatowicz
CS 152, or
Three hours of lecture per week.
In addition to the textbook, this course includes a number of readings from research papers. Such papers are important for a number of reasons, not the least of which is to understand that design decisions are not always black and white. Students will also undertake a major computing systems analysis and design project of their own choosing.
673 Soda Hall, 643-6587, email@example.com
Office Hours: Wed 3:30 - 4:30 PM, or by appointment
Contact Alice Bromund, 642-4334, firstname.lastname@example.org, 676 Soda, for appt.
447 Soda Hall, 642-3979, email@example.com
Office Hours: Tues 2 - 3 PM, Thurs 2 - 3 PM, or by appointment
|J. L. Hennessy and D. A. Patterson,
Computer Architecture: A Quantitative Approach,
2nd Edition, Morgan Kaufmann Publishing Co., Menlo Park, CA. 1996.
Note that the 2nd edition is significantly different than the 1st edition, and it is not recommended that you attempt to use the 1st edition as a textbook for this course.
The errata sheet for the 2nd edition is available here.
The first reader to report an error in the book and supply a correction that the authors incorporate in a future printing will be rewarded with a $1.00 bounty. To submit a bug, send a message to firstname.lastname@example.org with the page number and line number of the error in the subject line. (Check the errata sheet first.) Typically these bugs are reviewed by the both publisher and the authors about once a year before checks are issued, so please be patient.
Here's one place to buy the book.
One interesting resource that is now available (only to local Berkeley Hosts) is the ISCA 25-year retrospective in postscript and pdf. Several of the papers that we will be reading this term have retrospectives writen by the original authors that appar in this volume.
Announcements will be posted both on this web page and to the mailing list.
Lecture notes will be available in postscript, pdf, and powerpoint formats. Postscript files are good for printing, but pdf files are usually better for viewing on the screen. (Powerpoint is for instructors who want to give lectures themselves based on CS 252.)
Note that sometimes ghostview has trouble properly displaying postscript files, although they often print okay even when that occurs. Every effort will be made to get the notes on the web prior to the lecture. Note, however, that the notes may be updated slightly following the lecture. Click here for instructions regarding how to view pdf files.
Permission is granted to copy and distribute this material for educational purposes only, provided that the complete bibliographic citation and following credit line is included: "Copyright 1998 UCB." Permission is granted to alter and distribute this material provided that the following credit line is included: "Adapted from (complete bibliographic citation). Copyright 1998 UCB."
This material may not be copied or distributed for commercial purposes without express written permission of the copyright holder.
For a given lecture, if "ps, pdf" are in italics, that means that the available notes may be in preliminary (pre-lecture) form. Non-italics means that the notes are in their final (post-lecture) form.
|1||1||26-Aug||Wed||Review: Performance, Cost, DLX Instruction Set||ps, pdf, ppt||H&P: 1,2|
|2||28-Aug||Fri||Review: Pipeline, Cache, Branch Prediction||ps, pdf, ppt||H&P: 2,3|
|2||3||2-Sep||Wed||Prerequisite Quiz||Prerequisite Quiz|| |
|4||4-Sep||Fri||Control flow, interrupts, exceptions||ps, pdf, ppt||Reading assignment 1|
|3||5||9-Sep||Wed||Finish Exceptions. Loop unrolling, Simple code transformations||ps, pdf, ppt||Reading assignment 2||H&P:4.1,4.2|
|6||11-Sep||Fri||Out-Of-Order execution. Scoreboards and Reservation stations||ps, pdf, ppt||Reading assignment 3||H&P:4.3,4.4|
|4||7||16-Sep||Wed||Tomasulo 2/Dataflow, Software Pipelining, VLIW||ps, pdf, ppt||Reading assignment 4||H&P:4|
|8||18-Sep||Fri||Instruction Level Parallelism 2: Getting CPI < 1. Superscalar, VLIW, Software Pipelining, Vectors||ps, pdf, ppt||Nothing||H&P:B|
|5||9||23-Sep||Wed||Vector Processors. Branch Prediction. Dependence prediction.||ps, pdf, ppt||Homework assignment 1||H&P:B
Reading assignment 5
|10||23-Sep||Fri||Prediction: Branches, Dependences.
|ps, pdf, ppt||Reading assignment 6||Nothing|
|6||11||30-Sep||Wed||Data Dependence and Value prediction, Confidence estimation.
No slides today. Bring your papers from assignments 6 & 7
|Look Left||Reading assignment 7||Nothing|
|12||2-Oct||Fri||Value prediction; Confidence Estimation; Genetic Design of
No slides today. Bring your papers from assignment 7 & 8.
|In Class||Reading assignment 8||Nothing.|
|7||13||7-Oct||Wed||Quiz 1: 5:30-8:30. La Vals Afterwards.||Nothing||Nothing|
|14||9-Oct||Fri||Clear up of misconceptions from Quiz I.||In Class||Nothing||Start H&P:5|
|8||15||14-Oct||Wed||Confidence Estimation; Genetic Design of
Some slides today. Bring your papers from assignment 7 & 8.
Also, notes In Class
|16||16-Oct||Fri||Caches. Victim Caching, Prefetching, etc.||ps, pdf, ppt||Reading assignment 9||Continue H&P:5|
|--||20-Oct||Tue||Project Proposal Meetings. Sign up with Aaron for a 10-minute slot (10-11:30, 2-3)|
|17||21-Oct||Wed||Memory Systems/ECC codes||ps, pdf, ppt||Reading Assignment 10||Continue H&P:5|
No slides today; Bring papers from assignments 10 and 11
|Notes in class.
|Reading Assignment 11||Continue H&P:5|
|10||19||28-Oct||Wed||Virtual Memory||Notes in Class||Reading Assignment 12||Start H&P 8|
|20||30-Oct||Fri||Virtual memory continued. Cache Coherence; Memory Models||Homework assignment 2||Continue on H&P 8|
|11||21||4-Nov||Wed||Snoopy Cache/bus protocols.Bring papers from Assignments 12 and 13.||Will hand out notes in class.||Reading Assignment 13||Continue H&P 8|
|22||6-Nov||Fri||Implementation of snoopy protocols. Distributed directories.||Notes in class||Reading Assignment 14||Continue on H&P 8|
|12||23||11-Nov||Wed||Distributed directory and linked protocols continued. Protocol deadlock and solutions. Bring papers from Assignments 12 and 13.||Notes in Class||Continue H&P 8|
|24||13-Nov||Fri||Protocol Deadlock Continued. Avoiding network deadlock. Transaction buffers. Fast message-passing. Start on I/O.||Notes in class||Start H&P 6|
|13||--||17-Nov||Tue||Mid-term project oral report. Make sure to sign up for a time on Tuesday to talk to Aaron and John Kubiatowicz.|
|25||18-Nov||Wed||Networks. Classification and deadlock||Notes in class||Reading Assignment 15||Continue H&P:6|
|20-Nov||Fri||Quiz II; Pizza at LaVal's afterwards|
|14||26||25-Nov||Wed||Disk I/O and queueing theory.||ps,
Also: Notes in class
|Make sure to finish H&P 6|
|27-Nov||Fri||Holiday: no class! (recovery from too much food)|
|15||27||2-Dec||Wed||Disk I/O and queueing theory continued.||ps,
Also: Notes in class
|Make sure to finish H&P 6|
|4-Dec||Fri||Quantum Computing and Other|
Click here for a list of potential class projects.
In the future, information about presentations and papers, will be posted here.
Related Course Pages
Other Useful Links