Computer Architecture Syllabus

Syllabus of the Computer Architecture course

Date	Title of the lecture	Required reading	Slides	Homework Due
Feb 7	General introduction to the course	H & H: Chapters 1.1, 1.2 and 1.3 Moore: Cramming More Components onto Integrated Circuits, 1965	Lecture 1
Feb 14	Dataflow and parallelism	Patterson & Ditzel: The case for the Reduced Instruction Set Computer, 1980	Lecture 2	HW0 due Feb 14
Feb 21	Number systems	H & H: Chapter 1.4	Lecture 3	HW1 due Feb 28
Feb 28	Programming in C: basic types and control flow	K & R: Chapters 2 and 3 H & H: Appendix C	Lecture 4
Mar 3	Programming in C: arrays, strings and functions	K & R: Chapters 4 and 5 H & H: Appendix C
Mar 9	Programming in C: pointers, structures and unions	K & R: Chapters 5 and 6 H & H: Appendix C
Mar 14	Programming in C: explicit allocation and linked lists	K & R: Chapters 6 H & H: Appendix C
Mar 21	Programming in C : the UNIX System Interface	K & R: Chapters 7 and 8 H & H: Appendix C
Mar 28	Boolean logic and Karnaugh maps	H & H: Chapter 2.1 to 2.10
Apr 4	Latches and flip-flops	H & H: Chapter 3.1 to 3.3
Apr 11	Finite state machines	H & H: Chapter 3.4 to 3.7
Apr 18	Digital Building Blocks	H & H: Chapter 5
Apr 25	The MIPS instruction set architecture	H & H: Chapter 6
May 4	Single-cycle microarchitectures	H & H: Chapter 7.1 to 7.3
May 9	Multi-cycle microarchitectures	H & H: Chapters 7.4 Wilkes : The best way to design an automatic calculating machine, 1951.
May 12	Pipelining and dependence hazards	H & H: Chapter 7.5 to 7.10 Anderson, Sparacio, Tomasulo: The IBM System 360 Model 91: Machine Philosophy and Instruction Handling, 1967.