CS 210: Introduction to Computer Architecture

Date	Topic and reading	Assignments
Week 1
Mon, Feb 02	Introduction [slides] No reading	Problem Set 0: Syllabus
Wed, Feb 04	Assembly language [slides] Reading Computer Organization and Design. Section 1.3
Fri, Feb 06	Computer organization [slides] Reading Computer Organization and Design. Sections 1.4 and 1.5
Week 2
Mon, Feb 09	Assembly programming [slides] Reading Computer Organization and Design. Sections 2.1 and 2.2	Problem Set 1: MIPS
Wed, Feb 11	Assembly continued [slides] Reading Computer Organization and Design. Section 2.3
Fri, Feb 13	Number representation [slides] Reading Computer Organization and Design. Section 2.4 through Hardware/Software Interface
Week 3
Mon, Feb 16	Negative numbers and overflow [slides] Reading Computer Organization and Design. Section 2.4 remainder	Problem Set 2: Number representation Lab 1: MIPS
Wed, Feb 18	Representing instructions [slides] Reading Computer Organization and Design. Section 2.5
Fri, Feb 20	Bitwise operations [slides] Reading Computer Organization and Design. Section 2.6
Week 4
Mon, Feb 23	Branches [slides] Reading Computer Organization and Design. Section 2.7	Problem Set 3: Bit-level operations Lab 2: Bit-level operations
Wed, Feb 25	Procedures [slides] Reading Computer Organization and Design. Section 2.8 up to Allocating Space for New Data on the Stack
Fri, Feb 27	The stack [slides] Reading Computer Organization and Design. Section 2.8 remainder
Week 5
Mon, Mar 02	More stack [slides] Reading Computer Organization and Design. Section 2.14	Problem Set 4: MIPS Lab 3: MIPS Fibs
Wed, Mar 04	Digital logic [slides] Reading Computer Organization and Design. Appendix B.2
Fri, Mar 06	Boolean algebra [slides] Reading Computer Organization and Design. Appendix B.3 Decoders & Multiplexors
Week 6
Mon, Mar 09	Combinational logic [slides] Reading Computer Organization and Design. Appendix B.3 skip don’t cares	Problem Set 5: Digital logic Lab 4: MIPS Array
Wed, Mar 11	ALU [slides] Reading Computer Organization and Design. Appendix B.5 skip Defining the MIPS ALU in Verilog
Fri, Mar 13	Clocks [slides] Reading Computer Organization and Design. Appendix B.7
Week 7
Mon, Mar 16	Clocks and Flip-flops [slides] Reading Computer Organization and Design. Appendix B.8	Problem Set 6: Multiplexers & adders Lab 5: 7-segment display
Wed, Mar 18	Performance [slides] Reading Computer Organization and Design. Section 1.6
Fri, Mar 20	More Performance [slides] No reading
Week 8
Mon, Mar 23	No class: spring break No reading
Wed, Mar 25	No class: spring break No reading
Fri, Mar 27	No class: spring break No reading
Week 9
Mon, Mar 30	Floating point [slides] Reading Computer Organization and Design. Section 3.5 up to Floating-Point Addition	Problem Set 7: Flip-flops Lab 6: Adder/subtractor
Wed, Apr 01	Floating point [slides] Reading Computer Organization and Design. Section 3.5 remainder
Fri, Apr 03	MIPS addressing [slides] Reading Computer Organization and Design. Section 2.10
Week 10
Mon, Apr 06	Data path [slides] Reading Computer Organization and Design. Sections 4.1 and 4.2	Problem Set 8: Floating point & performance Lab 7: Counter
Wed, Apr 08	Data path [slides] Reading Computer Organization and Design. Section 4.3
Fri, Apr 10	Control path [slides] Reading Computer Organization and Design. Section 4.4
Week 11
Mon, Apr 13	Control path continued [slides] No reading	Problem Set 9: Data path Lab 8: Floating point
Wed, Apr 15	Pipelining [slides] Reading Computer Organization and Design. Section 4.6
Fri, Apr 17	Pipelining [slides] Reading Computer Organization and Design. Section 4.7
Week 12
Mon, Apr 20	Pipelining and Data hazards [slides] Reading Computer Organization and Design. Section 4.8	Problem Set 10: Pipelining
Wed, Apr 22	Control hazards [slides] Reading Computer Organization and Design. Section 4.9
Fri, Apr 24	Catch up No reading
Week 13
Mon, Apr 27	Caches [slides] Reading Computer Organization and Design. Sections 5.1 and 5.2	Problem Set 11: Branch prediction Final project: Caches
Wed, Apr 29	Caches [slides] Reading Computer Organization and Design. Section 5.3
Fri, May 01	Caches [slides] Reading Computer Organization and Design. Section 5.4
Week 14
Mon, May 04	Caches [slides] No reading	Problem Set 12
Wed, May 06	Caches [slides] No reading
Fri, May 08	Definitely more caches [slides] Reading P.J. Fleming and J.J. Wallace. How not to lie with statistics: the correct way to summarize benchmark results.