Princeton University
Computer Science Department

Computer Science 471
Computer Architecture

David August

Fall 2005

Course Description

An introduction to computer architecture and organization. Instruction set design; basic processor implementation techniques; performance measurement; caches and virtual memory; pipelined processor design; RISC architectures; design trade-offs among cost, performance, and complexity.

Announcements

  • Dec 15: Problem Set 4 is now available.
  • Dec 10: Extra 3rd edition problem suggestions with answers are available from the companion site.
  • Dec 10: Extra problem suggestions are now available. Your TAs and I are happy to help you with these.
  • Dec 10: Problem Set 3 is now available.
  • Nov 14: Midterm Solutions are now available
  • Nov 7: Project 2 [PDF] is now available.
  • Oct 18: Sample Midterms are now available.
  • Oct 14: Problem Set 2 is now available.
  • Oct 3: Project 1 [PDF][PS] is now available.
  • Sept 30: Problem Set 1 is now available.
  • Sept 9: This is the official web page for COS471A, COS471B/ELE375. Welcome! -DIA

    • Course Syllabus/Lectures

    All Course Lecture Notes including 1x1, 2x2, and 3x1 formats
    September 15: Introduction Read Chapter 1, Quiz 0!
    September 20: ISA 1 Read Chapters 1,2, Appendix B
    September 22: ISA 2 No Quiz!
    September 27: Metrics
    September 29: Arithmetic Read Chapters 1-4/B, Project partner selection after class, No Quiz!
    October 4: Arithmetic Read Chapters 1-5/B
    October 6: Datapath No Quiz!, Problem Set 1 due at 5PM
    October 11: Control
    October 13: Microprogramming No Quiz!
    October 18:Pipelining Read Chapters 1-6/B
    October 20:Pipeline Control No Quiz!
    October 21: Problem Set 2 Due at 5PM
    October 25: Q&A, Review Project #1 Due at 5PM
    October 27: MIDTERM
    October 31-November 4: FALL BREAK!
    November 8:Branch PredictionRead Chapters 1-6/B
    November 10:Branch PredictionNo Quiz!
    November 15: RTLRead Chapters 1-7/B, Guest Lecture
    November 17: Memory HierarchyRead Chapters 1-7/B, Quiz!
    November 22:Memory Hierarchy
    November 23-25:THANKSGIVING BREAK
    November 29:Virtual MemoryRead Chapters 1-7/B
    December 1:Virtual MemoryNo Quiz!
    December 6:I/O and DiskRead Chapters 1-9/B
    December 8:Memory TechnologyNo Quiz!
    December 13:Instruction-Level Parallelism
    December 15:Multiprocessor ParallelismQuiz!
    December 19:Problem Set 3 Due at 5PM
    December 16-January 9:WINTER BREAK
    January 17: Problem Set 4 Due at 5PM, no late days may be used
    January 17:Project #2 Due, no late days may be used
    January 28, 9AM:FINAL ExamRoom: Friend Center 006

    Final Exam Information

    The final exam will cover the material covered in lecture and in the text. You will have 3 hours for the final exam. The final exam is closed book. Only two two-sided, handwritten 8.5x11 sheets will be allowed. No calculators will be allowed.
    Sample Final 1 Sample Final 2 Sample Final 3 Sample Final 4

    Supplemental Reading

    Two-Level Branch Prediction A Comparison of Dynamic Branch Predictors that use Two Levels of Branch History by T.-Y. Yeh and Y. Patt
    SMT Simultaneous Multithreading: Maximizing On-Chip Parallelism by Dean M. Tullsen, Susan J. Eggers, and Henry M. Levy
    Cache Coherence A Survey of Cache Coherence Schemes for Multiprocessors by Per Stenstrom
    ILP1 Instruction-Level Parallel Processing: History, Overview and Perspective by B. Rau and J. Fisher
    ILP2 Compiler Technology for Future Microprocessors by W. Hwu, R. Hank, D. Gallagher, S. Mahlke, D. Lavery, G. Haab, J. Gyllenhaal, and D. August
    DRAM A Case for Studying DRAM Issues at the System Level by B. Jacob

    Project References

  • The PAW Architecture Reference Manual
  • PAW Binutils Documentation

    • Text

    Computer Organization and Design: The Hardware/Software Interface by David Patterson and John Hennessy. Third edition.

    Grading

    COS471A COS471B/ELE375
    Project 0% 40%
    Midterm 25% 15%
    Final 40% 25%
    Quizzes 10% EXTRA CREDIT
    Participation 5% 5%
    Homework 20% 15% (best 3 of 4)

    Collaboration Policy

    Assignments should be attempted individually. If you cannot come up with an answer after trying for a while then you may discuss the material or specific issue with a friend/TA/Prof. The answers should be your own. In other words, don't discuss or compare your answers to an assignment with anyone or any source.

    Project teams should work independently. Collaboration among team members is unrestricted (obviously).

    Administrative Information

    Lectures: TTh 1100-1220, Room: FC109

    Professor: David August - 209 CS Building - 258-2085 - Office Hours: after class or by appointment.

    Undergraduate Coordinator: Donna O'Leary - 410 CS Building - 258-1746 doleary@cs.princeton.edu

    Teaching Assistants:

    Jonathan Chang 004 CS Building 258-1785 Office Hours: TTh 2-3PM
    Easwaran Raman 213 CS Building 258-7727 Office Hours: MW 11-Noon
    Mike Wawrzoniak 216 CS Building 258-5330 Office Hours: MW 1-2PM