Computer Architecture

Engineering Sciences 116
Computer Science 107
Fall 2006

Syllabus

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