CS267: Lecture 2
Memory Hierarchies
August 29, 2001
Lecturer: Kathy Yelick
Abstract
We study the structure and performance properties of modern processors, with
special attention on their memory hierarchies. We describe a type of
memory benchmark that can be used ot expose performance feature of the memory
hierarchy, and look at some examples from specific machines. We discuss
optimizations techniques for uniprocessors, especially cache and register
blocking (also called tiling). Matrix multiply is a running example in the
lecture.
2001 Lecture Notes
PowerPoint, Postscript,
PDF
Readings
Assignments
Assignment 1
(due 9/19/01). We have assigned "multidisciplinary" teams of 2-3 students
for this assignment. If you are not in a team, please contact David Bindel (dbindel@cs).