CS612 Course Schedule and Slides
January
- 25, Overview of course [ps]
- 27, Computational Requirements of Scientific Applications [ps]
February
- 1, Cache Models [ps]
- 3, Memory Hierarchies [pdf]
- 8, Loop Transformations [ps]
- 10, Solving Systems of Inequalities [ps]
- 15, Solving Systems of Inequalities, cont.
- 17, Fourier-Motzkin Elimination
- 22, Transformations and Dependences [ps]
- 24, Transformations and Dependences, cont.
- 29, Synthesizing Transformations [ps]
March
- 2, Synthesizing Transformations, cont.
- 7, Transforming Imperfectly Nested Loops [ps]
- 9, Transforming Imperfectly Nested Loops, cont.
- 14, Locality Enhancement for Imperfectly Nested Loops [ps]
- 16, Locality Enhancement for Imperfectly Nested Loops, cont.
- 28, Locality Enhancement for Imperfectly Nested Loops, cont.
- 31, Scalar Optimizations [ps]
April
- 4, Scalar Optimizations, cont.
- 6, Scalar Optimizations, cont.
- 11, Control Dependence [ps]
- 13, Control Dependence, cont.
- 20, The Roman Chariots Problem
- 25, Interprocedural Analysis [ps]
- 27, Interprocedural Analysis, cont.
May
NOTE! NOTE! NOTE!
This schedule is tentative and subject to change without notice
James Ezick
Last modified: Thursday, April 27, 2000 12:50:26 PM