` CS 252 (Fall '98): Graduate Computer Architecture

Computer Science 252: Graduate Computer Architecture (4 units)

Professor John Kubiatowicz
Fall 1998

Quick jump to:
Class signup | Announcements | Course/Instructor Information | Schedule | Handouts | Projects | Resources

Class Sign-up

We are keeping an electronic list of everyone registered in CS252 for this fall. If you are taking the class, please click here and fill out the on-line sign-up form. This will also automatically add you to the class mailing list.


Quiz 2, Quiz 2 Statistics, and Quiz 2 Solutions are now available.

Just to reiterate: Quiz II is tomorrow (Friday 11/20) in room 306 Soda-Hall, from 5:30-8:30. Remember to bring a calculator.

Reading Assignment #15 is now available. Make sure to sign up for a project meeting tomorrow. There is a signup sheet on Prof Kubiatowicz's door.

Also, Don't forget Quiz II on Friday the 20th!

Solutions for homework 2 are available here.

Reading Assignment #14 is now available.

Reading Assignment #12 and Reading Assignment #13 are now available.

Homework Assignment #2 is now available. It is due a week from Friday (10/30).

Reading assignment 10 and Reading Assignment 11 are now available.

Quiz 1, Quiz 1 Statistics, and Quiz 1 Solutions are now available.

7-Oct: Tonight's quiz is in 277 Cory hall at 5:30.

29-Sep: Solutions for homework 1 are available here.

26-Sep: Don't forget that QUIZ 1 is on Oct 7th.
Reading assignment 7 and Reading assignment 8 are now available. They are due in class on Wednesday (9/30) and Friday (10/2) respectively.

Reading assignment 6 is now available. It is due in class on Friday (9/23).

Reading assignment 5 is now available. This is a soft assignment (no paragraph), but is recommended for class on Wednesday.

Aaron's office hours on Thursday will be from 2 - 3 PM for the remainder of the semster. They are cancelled for this Thurday, 17 September. If you want to talk to me (Aaron) this week, please send email to arrange a time.

Reading assignment 4 is now available. It is due in class on Wednesday (9/16).

Also, Homework Assignment #1 is now available. It is due a week from Wednesday (9/23)

Reading assignment 3 is now available. It is due in class on Friday (9/11).
Your reading assignments will be checked off and will contribute to your class participation. They will also be "spot-checked" for content (on random, unannounced days). I will be returning previous ones on Friday.

Reading assignment 2 is now available. It is due in class on Wednesday (9/9).

Reading assignment 1 is now available. It is due in class on Friday (9/4).
Results of the prerequisite quiz have been mailed out. The solution set to the quiz is available here.

There will be a review session for the prerequisite quiz on Sunday afternoon at 1:00 PM in Soda 310.

Welcome to CS252! Please be sure to fill out the on-line signup form if you are intending to take the class.

Click here for older announcements.

CS252 Course Information

Catalog Description
Graduate survey of contemporary computer organizations covering: early systems, CPU design, instruction sets, control, processors, busses, ALU, memory, pipelined computers, multiprocessors, and case studies. Term paper or project required.

Prerequisites: CS 152, or equivalent.
Three hours of lecture per week.

Expanded Description
Computer architecture is a vibrant and ever changing field; this course will attempt to convey that to students. It focuses on the design and implementation of computer architectures, as well as techniques for analyzing and comparing alternative computer organizations. Students will learn about styles of computer implementation and organization from a historical and modern perspective. Traditional concepts such as pipelining, instruction-level parallelism, memory hierarchies, and input/output architectures will be discussed. Further, modern issues such as data speculation, dynamic compilation, communication architecture, and VLSI scaling concerns will be introduced and discussed. Toward the end, cutting-edge paradigms such as DNA computation and quantum computing will be examined.

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.

Course Grading
10% Class Participation
30% Homeworks (work in pairs)
30% Examinations (2 Quizzes)
30% Research Project (work in pairs)
See also Departmental Grading Guidelines for Graduate courses

Instructors, Fall 1998
Prof. Kubiatowicz Lecturer: Professor John Kubiatowicz

673 Soda Hall, 643-6587, kubitron@cs.berkeley.edu
Office Hours: Wed 3:30 - 4:30 PM, or by appointment
Contact Alice Bromund, 642-4334, alyceb@cs.berkeley.edu, 676 Soda, for appt.
Aaron Brown Teaching Assistant: Aaron Brown

447 Soda Hall, 642-3979, abrown@cs.berkeley.edu
Office Hours: Tues 2 - 3 PM, Thurs 2 - 3 PM, or by appointment

Lecture: Wed, Fri 2:00 - 3:30 PM, 310 Soda Hall

photo of text cover J. L. Hennessy and D. A. Patterson, Computer Architecture: A Quantitative Approach, 2nd Edition, Morgan Kaufmann Publishing Co., Menlo Park, CA. 1996.
ISBN: 1558603298

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 arc2bugs@mkp.com 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.

Additional Reading
There will be no formal reader for this class. Required and recommended papers will be distributed in class; extras will be available at a place TBA.

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.

Click here to see who's who.

The course newsgroup is ucb.class.cs252. The course-wide mailing list is cs252-l@ribbit.cs.berkeley.edu.

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.

Week Lect. Date Day Lecture Notes Due Reading
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.
CS252 Projects
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 Branch Predictors
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 Branch Predictors
Some slides today. Bring your papers from assignment 7 & 8.
ps, pdf, ppt
Also, notes In Class
Nothing Continue H&P:5
16 16-Oct Fri Caches. Victim Caching, Prefetching, etc. ps, pdf, ppt Reading assignment 9 Continue H&P:5
9 -- 19-Oct Mon     Project Proposal  
-- 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
18 23-Oct Fri ECC Codes
No slides today; Bring papers from assignments 10 and 11
Notes in class.
Look left.
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, pdf, ppt
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, pdf, ppt
Also: Notes in class
  Make sure to finish H&P 6
  4-Dec Fri Quantum Computing and Other      


There are no assignments yet.

Solutions to assignments (limited to berkeley.edu domain)
There are no solution sets yet.

In-class Handouts
There have been no handouts yet.

Course Projects

Final Projects for Fall '98

Click here for a list of potential class projects.

In the future, information about presentations and papers, will be posted here.

Resources for CS252

Previous Quizzes
Past quizzes and solutions are available here.

Related Course Pages

Project Resources

Click here for some resources at your disposal for project work.

Other Useful Links

Maintained by Aaron Brown (abrown@cs.berkeley.edu). Last modified 3 September 1998.