Computer Architecture

Engineering Sciences 116
Computer Science 107
Fall 2007

Syllabus

Week M Tu W Th F
Sep. 24 -
Sep. 28
24
-
25
-
26
NO CLASS
27
-
28
NO CLASS
Oct. 1 -
Oct. 5
1
Introduction, Chapter 1; Cost/Performance, Overview
2
-
3
Chapter 1; Amdahls law, Speedup, Benchmarking
4
-
5
Chapter 2; Instruction set design, Memory addressing
Oct. 8 -
Oct. 12
8
Chapter 2, Appendix A; Instruction set design, Pipelining
9
-
10
Appendix A; Pipelining and Hazards
11
-
12
Appendix A; Pipelining difficulties, exceptions, and the MIPS R4000
Oct. 15 -
Oct. 19
15
Chapter 3; Dynamic Scheduling, Scoreboarding
16
-
17
Chapter 3; Dependences, Tomasulo's algorithm
18
-
19
Chapter 3, Chapter 4; Branch prediction and Speculation
Project Proposals due
(Home Coming)
Oct. 22 -
Oct. 26
22
Chapter 4; Software Pipelining, Loop unrolling
23
-
24
Chapter 4; Hardware support for Compile time parallelism
25
-
26
Review and Questions
Oct. 29 -
Nov. 2
29
Midterm
30
-
31
Chapter 5; Memory Hierarchy and Caches
1
-
2
Chapter 5; Cache performance
Nov. 5 -
Nov. 9
5
Chapter 5; Virual Memory
6
-
7
Chapter 6; Multiprocessors and Thread-Level Paralellism
8
-
9
Chapter 6; Multiprocessors and cache coherency
Nov. 12 -
Nov. 16
12
Chapter 6; Cache coherency and Symmetric Multithreading
13
-
14
Chapter 7: Storage systems and I/O
15
-
16
Chapter 7: I/O and RAID
Nov. 19 -
Nov. 23
19
Chapter 8: Interconnection networks 1
20
Thanksgiving Recess
21
Thanksgiving Recess
22
Thanksgiving Recess
23
Thanksgiving Recess
Nov. 26 -
Nov. 30
26
Chapter 8: Interconnection networks 2
27
-
28
Chapter 8: Clusters
Extra material
Project reports due
29
-
30
Project presentations
Dec. 3 -
Dec. 7
3
Project presentations
4
Pre-exam break
5
Pre-exam break
6
Pre-exam break
7
Finals
Exam pickup, Questions
Dec. 10 -
Dec. 14
10
Finals
11
Finals
Submit take-home exam
12
-
13
-
14
-