| 12/6 |
Lecture slides on Directory Protocols available. |
| 12/2 |
Posted last year's final exam.
Lecture slides on Snoopy Protocols available. |
| 12/1 |
Posted Assignment 6. |
| 11/26 |
Second set of lecture slides on Memory Hierarchy available. |
| 11/22 |
Lecture slides on Memory Hierarchy available. |
| 11/20 |
Lecture slides on Main Memory available. |
| 11/18 |
Second set of lecture slides on Cache
Performance available.
Posted midterm solution and Assignment 5. |
| 11/6 |
Lecture slides on Cache Design and first set on Cache Performance are available. |
| 11/5 |
Lecture slides on Multithreading available. |
| 10/31 |
Assignment 4 has been
handed out in lecture yesterday.
Posted last year's midterm in Exams (under Classwork).
Lecture slides on VLIW available. |
| 10/28 |
Lecture slides on
Multiple Issue available. |
| 10/25 |
New Bliss update fixing a bug in the BTB return stack. |
| 10/23 |
Assignment 3 has been
handed out in lecture today.
New version of Bliss available that fixes write-through bug. Please get a new copy. |
| 10/22 |
Posted Superscalar Processor paper in Extra
Readings (under Classwork). |
| 10/21 |
Lecture slides on second
part of Dynamic Scheduling available. |
| 10/18 |
Lecture slides on ILP
and first part of Dynamic Scheduling available.
Calendar updated to include our midterm date on
November 6th. |
| 10/16 |
Assignment 2 has been
handed out in lecture today. |
| 10/8 |
Second set of lecture slides on branch
prediction available.
Assignment 1 due tomorrow! |
| 10/4 |
Lecture slides on branch
prediction available. |
| 10/3 |
Assignment 1 will be
handed out in today's Section. Due 10/9.
New version of Bliss available. Please download a fresh copy. |
| 10/1 |
Added a guideline for
writing homework reports on the 471 web page (under Classwork). |
| 9/27 |
Class starts Monday, September 30th.
Our textbook is J.Hennessy and D.Patterson, Computer
Architecture: A Quantitative Approach 3rd Edition, 2002
Please subscribe
yourself to the mailing list or read the archive
frequently. |
CSE Home 
