15-347 Spring '98
Class Handouts Available On-Line
All handouts identified as ``PDF'' are in Adobe Acrobat
format. This format has the advantage over
postscript of being viewable on a variety of platforms, including
(most) Unix machines, PC's, and MAC's.
You, can view and print these files using the publicly available Adobe
Acrobat Reader. On most campus Unix machines this is installed as the
program acroread. You can also download free copies of the
reader from Adobe Systems.
Handouts identified as ``PPT'' are in Microsoft Powerpoint format.
These were prepared using Version 4.0 on a Macintosh. They should be
readable from a Windows machine, as well.
Lecture notes
- Lecture 01 Course Introduction (Jan 13):
- Lecture 02 Measurement & Performance (Jan 15)
PDF,
PPT
- Lecture 03 Integer Arithmetic (Jan 20)
PDF,
PPT
Note: The slides shown in class had incorrect values for the 32-bit maximum & minimum values. These have been corrected in the electronic version here.
- Lecture 04 Floating Point Arithmetic (Jan 22)
PDF,
PPT
- Lecture 05 Implementing Fast Arithmetic (Jan 27)
PDF,
PPT
- Lecture 06 Memory Technology (Jan 29)
PDF,
PPT
- Lecture 07 Cache Structures (Feb 3)
PDF,
PPT.
The slides used in lecture had the simulation results shown blank
so that I could fill them in. If you want to look at the final
results, they are available separately
PDF,
PPT.
- Lecture 08 Cache Performance (Feb 5)
PDF,
PPT
-
The original slides shown in class had a bug in the blocked-matrix
multiply code. This has been corrected. Interestingly, this bug
appears in the graduate Hennessy & Patterson computer architecture
text, from which this code was extracted.
-
I have added two slides showing the performance of matrix
multiplication on the Alpha 21164s that we're using for this class.
The results are summarized in the Alpha Performance page.
- Lecture 09 Virtual Memory (Feb 10)
PDF,
PPT
- Lecture 10 Input/Output (Feb 12)
PDF,
PPT
- Lectures 11 & 12 Alpha Programming (Feb 19 & 24)
PDF,
PPT
- The electronic version corrects some typos in the version handed
out in class. In particular, the stack corruption example of slide
#44 mislabeled the "caller" as the "callee".
- Lecture 13 Alpha Data Structures (Feb 26)
PDF,
PPT
- Lecture 14 Code Optimization (March 3)
PDF,
PPT
- Lecture 15 Benchmarking (March 5)
PDF,
PPT
- Lecture 16 Instruction Set Comparison (March 10)
PDF,
PPT
- Lecture 17 Basic Processor Design (March 12)
PDF,
PPT
- Watch out! The Powerpoint file is huge!
- The original version
handed out in class had some annoying bugs. A revised version was handed
out on March 17. The electronic version corresponds to the revised version.
- Lecture 18 Handling Data Hazards (March 17)
PDF,
PPT
- Lecture 19 Handling Control Hazards (March 31)
PDF,
PPT
- Lecture 20 Exceptions and Multicycle Instructions (April 2)
PDF,
PPT
- Lectures 21 & 22 Superscalar Processors (April 7 & 9)
PDF,
PPT
- Lecture 23 Multimedia Computing (April 14)
PDF,
PPT
- Lecture 24 Network Technology (April 16)
PDF,
PPT
- Lecture 25 Internetworking (April 21)
PDF,
PPT
- Lectures 26 & 27 Multiprocessing (April 23 & 28)
PDF,
PPT
- Beware: another huge Powerpoint file (the PDF file is much more reasonable).