ECS 154B Computer Architecture

Announcements

Course grades are available here.

Paul has a useful TA web page here.

Make sure to read the class newsgroup (ucd.class.ecs154b ) everyday for announcements! Use the discussion newsgroup for questions (ucd.class.ecs154b.d).

Lecture: MW 6:10p-7:30p 202 Wellman
Discussion: F 3:10p-4:00p 202 Wellman
Units: 4
Instructor: Prof. Fred Chong office hours: MW 3:10-4:00 Eng II 3031
TA: Paul Sultana office hours: T 3p-4p, Th 11a-12p, F 12p-1p; TA Web Page
Grader (Labs): Sandy Wu
Text: Computer Organization and Design: The Hardware/Software Interface (2nd ed), by Hennessey and Patterson, 1998.

Grading

  • 5 Labs 50% (Labs 1,4,5 7% each; Lab 2 15%; Lab 3 14%)
  • 1 Midterm 20%
  • Final 30% 

    • Lectures

  • Lecture (M 4/1/02): Introduction

    • Reading for next lecture: All of Ch. 1, pay particular attention to "Fallacies and Pitfalls".

  • Lecture (W 4/3/02): Basic Datapath and Control

    • Reading for next lecture: 5.1-5.3
  • Discussion (F 4/5/02): Digital Design Review

  • Lecture (M 4/8/02): Microprogramming -- MIC-1 and MAC-1

    • Reading for next lecture: 5.4-5.10
    References:
    Prof. Matloff's notes on the MIC-1/MAC-1.
    Tanenbaum, "Structured Computer Organization", 4th edition, 1999.
  • Lecture (W 4/10/02): More Microprogramming

    • Reading for next lecture: 6.1-6.3
    Lab 1 out -- Microcode -- due 4/17/02 11:59pm 
  • Discussion: (F 4/12/02) Other types of microprogramming: MIC-2

  • Lecture (M 4/15/02): Pipelining

    • Reading for next lecture: 6.4
  • Lecture (W 4/17/02): Hazards and Exceptions

    • Reading for next lecture: 6.5-6.6
    Lab 1 due
    Lab 2 out -- MIC-1 -- 5/1/02
  • Discussion (F 4/19/02): Mic-1 Pipelining Examples

  • Lecture (M 4/22/02): More Pipelining

    • Reading for next lecture : 6.7-6.12
  • Lecture (W 4/24/02): Dynamic Instruction Scheduling

  • Discussion (F 4/26/02): Dynamic Scheduling: Scoreboarding

  • Lecture (M 4/29/02): Performance Metrics

    • Reading for next lecture : 2.4-2.10
  • Lecture (W 5/1/02): Caches

    • Reading for next lecture : 7.1-7.2
    Lab 2 due
  • Discussion (F 5/3/02): Midterm Review

    • Old exams from previous classes and other faculty are available, but are not necessarily representative of the exam.

    NOTE: The old exam solutions occasionally contain errors. It is your responsibility to understand and verify the solutions. Applying an error from an old exam to your exam will not get you credit.
     

  • Here is a review sheet specific to the midterm.

  • Midterm (M 5/6/02)

    • Lab 3 out -- Pipelining -- due 5/20/02 
  • Lecture (W 5/8/02): Cache Performance

    • Reading for next lecture : 7.4-7.7

    Discussion (F 5/10/02): Cache Examples 
  • Lecture (M 5/13/02) More Caches
  • Reading for next lecture : 7.3

  • Lecture (W 5/15/02): Virtual Memory

    • Reading for next lecture : 9.1-9.4
  • Discussion (F 5/17/02): Return midterms and recap

  • Lecture (M 5/20/02): Intro to Parallel Machines

    • Reading for next lecture : 9.5-9.6
    Lab 3 due
    Lab 4 out -- Cache Simulation -- due 5/29/02
  • Lecture (W 5/22/02): MIMD architectures
  • Discussion (F 5/24/02): Cache Performance

  • Memorial Day Holiday (M 5/27/02)
  • Lecture (W 5/29/02): Interconnection Networks

    • Reading for next lecture : 9.7-9.10
    Lab 5 -- due 6/5/02 out -- Parallel Programming 
  • Discussion (F 5/31/02): Return midterms and recap

  • Lecture (M 6/3/02): Future Trends in Parallel Machines

    • Reading for next lecture : 9.7-9.10
  • Lecture (W 6/5/02): Quantum Computing

  • Discussion (Th 6/6/02; 6:10 pm 202 Wellman): no lecture
  • Lecture (F 6/7/02; 3:10 pm 202 Wellman): Final Review

    • Here is a review sheet specific to the final.

  • Final (Mon 6/10/02) 7:00-9:00p 202 Wellman

    • MAX PLUS Documentation

  • Introduction and Section 1: MAX+PLUS II Installation
  • Section 2: MAX+PLUS II - A Perspective
  • Section 3: MAX+PLUS II Tutorial
  • Appendices

    •  

     
     
     

    Also available at the Altera site.

    Acknowledgements: Some materials in this course are based upon those developed by Norman Matloff. Thanks also to Kent Wilken. 
    Last updated October 20, 2002
    chong@cs.ucdavis.edu