Speaker(s):Charlie Peck, Henry Neeman, Tom Murphy, Dan Ernst
ABSTRACT: This session focuses on the implications of a fundamental reality: fast implies expensive implies small, and slow implies cheap implies large. The prerequisites are at least one semester of programming experience in C, C++ and/or Fortran, recently, and at least one semester of experience with any Unix-like operating system (including but not limited to Linux), recently. Topics include: registers; cache, RAM, and the relationship between them; cache hits and misses; cache lines; cache mapping strategies (direct, fully associative, set associative); cache conflicts; write-through vs. write-back; locality; tiling; hard disk; virtual memory. A key point: Parallel performance can be hard to predict or achieve without understanding the storage hierarchy.