Course Information for CS252: Graduate Computer Architecture

Spring 2019

Catalog Description: Graduate Computer Architecture

4.0 units. Three hours of lecture plus one hour paper discussion per week. Prerequisites: CS152 or equivalent.

Class Schedule/Rooms

Lectures: Monday and Wednesday, 1:00-2:30pm, 306 Soda Hall
Paper discussion: TBD
Both midterms held in class during lecture times.

Instructor: Krste Asanović, Professor, CS Division, EECS Department
Email: krste at eecs
Office Hours: Wednesday 10-11am, 579 Soda Hall (email to confirm)

TA: David Biancolin
Email: biancolin at eecs
Office Hours: Tuesday, 2-3pm, 529 Cory

TA: Albert Magyar
Email: albert.magyar at berkeley
Office Hours: Wednesday 4:30-5:30pm, 283H Soda

Course Grading

20% Paper readings

Paper summaries are posted as private notes on the Piazza thread for each paper. Each summary should include one paragraph summarizing main content of paper including good/bad points, plus 1-3 questions to contribute to paper discussion. We will not count the two lowest weeks' grades, which includes absence, but please send in summaries even if you cannot attend class.

30% Exams

There will be 2 midterms (15% for each) covering the class material. These will be closed book with no calculators, phones, smart watches, or computers allowed.

50% Class Project

Substantial research project by pairs of students, with 10-page conference-style paper and class presentation.

Late Assignment Policy

Problem sets must be handed in at the beginning of class on the due date, with no extensions possible. No other extensions will be given, unless for serious documented emergencies. An automatic F grade is given if the course project is not completed.

Collaboration Policy

The problem sets are intended to help you learn the material, and we encourage you to collaborate with other students and to ask questions in discussion sections and office hours to understand the problems. However, each student must turn in their own solutions to the problems.

Regrade Policy

For addition errors in the total score, return the midterm back to the TA to get it fixed. For regrades, return the midterm to the TA within a week of the midterm being graded with a separate sheet of paper explaining the discrepancy. The staff will carefully regrade the entire midterm, read the reasoning provided, and then make a final decision. Since the entire midterm is being regraded, it is possible the total score could go down as a consequence of previously undiscovered mistakes being found. We therefore recommend that regrade requests only be used when the case is strong and a significant number of points are at stake.

Academic Accommodation Policy

Students with disabilities who need accommodations in order to access this course will be accommodated. Please contact DSP and apply for services. If you have emergency medical information you wish to share, or if you need special arrangements in case the building must be evacuated, please inform us as soon as possible. Please see Krste privately after class or in his office.


The course will use Piazza for class communication. The course page can be found at

Compute Resources

All labs will be available on {icluster6, icluster7, icluster8, icluster9}.eecs. You may want to use other servers for writing code or compiling, and you can see a full list of them at inst.


The following textbook is highly recommended for the course:

TextBook Picture J. L. Hennessy and D. A. Patterson, Computer Architecture: A Quantitative Approach, 6th Edition, Morgan Kaufmann Publishing Co., Menlo Park, CA. December 2017.
ISBN13: 978-0128119051
ISBN10: 0128119055

We will also use material from the companion Web site.

The following textbook is recommended to refresh your background and to provide a simpler introduction to some of the basic concepts. Any recent edition should be sufficient for background study.

D. A. Patterson and J. L. Hennessy, Computer Organization and Design RISC-V Edition: The Hardware Software Interface, 1st Edition, Morgan Kaufmann Publishing Co., Menlo Park, CA., April 2017. 
ISBN13: 978-0128122754
ISBN10: 0128122757