• Course Syllabus
• Getting started with SimpleScalar
• Homeworks
• Homework 1, due January 13 -- solutions
• Homework 2, due January 22 -- solutions
• Homework 3, due January 29 -- solutions
• Homework 4, due February 5 -- solutions
• Homework 5, due February 12 -- solutions -- (see note)
• Homework 6, due March 12 -- solutions
  • NOTE: error in the solutions -- in 4(a).1, we should have 12 accesses per 4 iterations rather than 9 accesses. When we fetch B we have to write C back, then we fetch C again, for a total of 3 references even when C starts the iteration in the cache.
• solutions to practice problems
• Slides from Lectures
• Lecture 1, January 6
• Lecture 2, January 8
• Chap 3, January 27
• Chap 3, Tomasulo's Algorithm
• chap 3, Branch Prediction
• chap 3, Speculation
• chap 4, VLIW and related topics
• chap 5, part 1
• chap 5, part 2
• chap 5, part 3
• chap 5, Virtual Memory
• SimpleScalar Lecture by Stuart and Hacker's Guide to SimpleScalar
• Project Handouts
• Project Description
• Some tips for writing progress reports and final reports
• SimpleScalar Version 2.0 Users Guide

Lecture times:

Monday & Wednesday, 7-8:45 PM, BE 152 (also broadcast to Cupertino)

Instructor:

Name: Anujan Varma (varma@soe.ucsc.edu)

Phone: 459-3505

Office: BE 313

Instructor Office Hours:

Mondays, 4:00-6:00 PM

Teaching Assistant:

Name: Stuart Norton (stuart@soe.ucsc.edu)

New Office Hours:

Tuesday 12:00-1:00 PM and Friday 11:30-12:30 in BE 352