ArsDigita University
How Computers Work
Month 3 Syllabus
- 01. Dec 01 - Philosophy and Roadmap, Simple Programs, Beta ISA
- 02. Dec 03 - Storage Allocation, Stack Discipline, Calling Conventions
- 03. Dec 04 - Unpipelined Beta, Exceptions
- 04. Dec 05 - Implementing the ALU
- 05. Dec 06 - Implementation of Beta Memories
- 06. Dec 07 - Synchronous Finite State Machines (FSMs)
- 07. Dec 08 - Flip flops, Asynchronous FSMs, Dynamic Discipline, Timing
- 08. Dec 11 - Arbitration and Metastability
- 09. Dec 12 - Static Discipline, Transistor-level design
- 10. Dec 13 - Physics of Communication and Computation
- 11. Dec 14 - Latency vs. Throughput, Explicit Parallelism
- 12. Dec 15 - Pipelining the Beta, Hazards, Stalling, Anullment
- 13. Dec 18 - Caches
- 14. Dec 19 - Virtual Memory, Cache Coherence, Integration of Caches
- 15. Dec 20 - Communications Networks
- 16. Dec 21 - Explicitly Parallel Machines, Future Machines
| Sun
| Mon
| Tue
| Wed
| Thu
| Fri
|
| Lecture Schedule
| 1
noon
|
3
noon
| 4
11:00am
| 5
2:00pm
| 6
2:00pm
| 7
10:00am
| 8
2:00pm
|
10
quiz 1
| 11
11:00am
| 12
9:45am
| 13
2:00pm
| 14
11:30am
| 15
11:30am
|
17
quiz 2
| 18
11:00am
| 19
9:45am
| 20
10:00am
| 21
11:30am
| 22
final
|