CSE 60321: Graduate Computer
Architecture
Instructor
Michael
Niemier
380
Fitzpatrick Hall
mniemier
at nd . edu
(574)
631-3858
Office Hours (instructor)
Thursday
8 – 10 a.m., 4 – 5 p.m.
Course Outline
|
|
Date |
Topic |
Assignments |
Detail |
|
1 |
16-Jan |
Logistics & Introduction |
|
Lecture
Topics: a. Logistics b. Architectural abstractions c. Architecture & technology d. Performance evaluation |
|
2 |
18-Jan |
Performance Metrics |
|
Lecture
Topics: a. Latency b. Throughput c. Benchmarks d.
CPI examples (board) |
|
3 |
21-Jan |
Performance Metrics |
Out HW 1 (Word) (HTML) |
Lecture
Topics: a. Amdahl's Law b. Board examples c. Little's Law d. Yield e. Manufacturing costs |
|
4 |
23-Jan |
Instruction Set Architectures |
|
Lecture
Topics: a. History b. Basics c. Instruction sizes d. Instruction modes e. Instructions & data storage |
|
5 |
25-Jan |
Instruction Set Architectures |
|
Lecture
Topics: a. Instructions & data storage b. Control-flow instructions |
|
6 |
28-Jan |
Instruction Set Architectures |
|
Lecture
Topics: a. Caller/callee b. RISC vs. CISC c. x86 Case Study |
|
7 |
30-Jan |
Pipelining |
|
Lecture
Topics: a. Basic idea b. Pipe diagrams c. Mathematics of d. Clock Rate vs. IPC |
|
8 |
1-Feb |
Pipelining |
|
Lecture
Topics: a. Clock Rate vs. IPC b. Hazards |
|
9 |
4-Feb |
Pipelining |
HW 1 Due Out HW 2 (Paper #1) (Paper #2) (Word) (HTML) |
Lecture
Topics: a. Control hazards b. Branch prediction (preview) c. Multi-cycle instructions d. Loop unrolling e. Effects of interrupts f. Wrap-up |
|
10 |
6-Feb |
Dynamic Scheduling |
|
Lecture
Topics: a. Motivation b. Basic ideas c. Superscalar Machines |
|
11 |
8-Feb |
Dynamic Scheduling |
|
Lecture
Topics: a. Scoreboard vs. Standard pipe b. Register renaming c. Tomasulo's Algorithm |
|
12 |
11-Feb |
Dynamic Scheduling |
|
Lecture
Topics: a. Tomasulo's Algorithm b. Branch prediction mechanisms |
|
13 |
13-Feb |
Dynamic Scheduling (See Lecture 12 slides) |
|
Lecture
Topics: a. Branch prediction mechanisms |
|
14 |
15-Feb |
Dynamic Scheduling |
|
Lecture
Topics: a. Branch prediction mechanisms b. Detailed examples |