University of
California, Davis
Department of
Electrical and Computer Engineering
EEC 170 – Computer Architecture
Fall 2005
- Class
announcements
- (12/07) The solution to sample final problems is posted on
the slides page.
- (12/05) Sample final is posted on
the slides page. I strongly encourage you to work on it before the last
lecture to better follow the discussions on wednesday.
- (11/29) Quiz 3 (covering chapter 7) will be given on wednesday 12/7 at the beginning of the class.
- (11/29) The last lecture of the quarter (wednesday
12/7) will be spent on quiz and final review. I strongly recommend
you to study before that lecture, and bring your questions to discuss.
- (11/29) HW #6: problems 7.4, 7.10, 7.12, 7.16, 7.29, 7.39, 7.41. Due date: Friday 12/9
at 5pm.
- (11/23) HW #5 (part 2): problems 6.33, 6.37, 6.48, 6.49. Due date: Friday 12/2
at 5pm. (Note that HW #5 has a total of eight problems four of which were assigned on 11/16)
- (11/17) Midterm solutions are posted on the slides page.
- (11/16) We will have a 30-minute quiz on wednesday 11/23 on processor organization and pipelining (chapters 5 and 6).
- (11/16)
HW #5 (part 1): problems 6.14, 6.22, 6.36, 6.39. Due date friday 12/2
at 5pm, however, I strongly recommend you to work on them as soon as
possible to practice with the material, and be able to follow the
lectures.
- (11/04) The midterm will be closed book/closed notes. You can only use the 'green card' and a simple calculator.
- (11/02)
Just a reminder that the midterm will be on Wednesday (11/09) in class.
It will cover up to, and including chapter 5 of the text.
- (11/02) HW
#4: problems 5.10, 5.12, 5.34, 5. 37, 5.38, 5.51, 5.53. Due date: Friday 11/11 at 5pm.
- (10/26) We will have a 30-45 minute quiz on monday 10/31. It will cover chapters 1, 2 and 3.
- (10/26) HW
#3: problems 4.8, 4.9, 4.10, 4.11, 4.38-44 (seven sections of one problems). Due date: Friday 11/4 at 5pm.
- (10/19) HW
#2: problems 3.9, 3.11, 3.15, 3.23, 3.27, 3.30, 3.34, 3.41, 3.43, 3.48. Due date: Friday 10/28 at 5pm.
- (10/12) HW
#1: problems 2.4, 2.5, 2.6, 2.9, 2.15, 2.28, 2.30, 2.31, 2.37, 2.38,
2.54 and 2.55 from the text. Due date: Friday 10/21 at 5pm.
- (10/9) The lecture
viewgraphs are posted online (in pdf). The page is password
protected, and the username and password are emailed to class
list.
- (10/9) The TA office location and
office hours have been updated (M 4-6 @2101 Kemper).
- (9/29)
There will be
no class no Monday (10/3).
- (9/29)
Class
announcements will be posted here. Please hit the reload button to make
sure you read the updated version.
- Slides
- lecture slides
- The credit for
some of lecture
slides goes to Prof Ryan Kastner (UCSB), Prof John Owens
(UC-Davis), Prof Kent Wilken (UC-Davis) and publisher instructor
resources. While I try to cite the
sources during the lectures, I would like to thank my
colleagues
once again and acknowledge their work.
- Time
and location
- Lectures: MW
210-4pm @Wellman
126
- Instructor
- Soheil Ghiasi
- Office: 3171
Kemper Hall
- Office Hours:
Thursday 3-5 pm
- Teaching
Assistant
- Christophe
Giacomotto (giacomoc “put-at-sign-here”
ucdavis.edu )
- Office: 2101
Kemper Hall
- Office Hours:
Monday 4-6 pm
- Communication
- Course web page:
http://www.ece.ucdavis.edu/~soheil/ teaching/EEC170A-F05/
- Email. (please
use email to contact me only for urgent or personal matters that CANNOT
be handled through office hours, in-class questions, or immediately
after class.)
- Grading
Policy
- Homework %20
- Quiz %10
- Midterm exam %30
- Final Exam %40
- Additional
Course Information
- Prerequisites:
EEC 70 and EEC 180A
- All quizzes and
exams cover material from assigned readings, lectures, and homework.
Some material may be present in only one of these sources. Some
questions might not be directly discussed in class, but they
are solvable by analyzing and applying the covered material
(i.e.
you are expected to be able to show some degree of reasoning
and
analytical thinking).
- Midterm exam
will be on Wednesday 11/9/05 in class.
- Final exam will
be
cumulative but with an emphasis on material since the midterm. It will
be on 12/16/2005 at 1:30 pm.
- Course
Policy
- Homework
- All work must
be done individually. On each homework, write your name, and problem
set number clearly at the top.
- All homeworks
are due on Friday at 5pm. You can drop the homeworks in the
course hw box in room 2111. Unfortunately,
late homeworks will not be accepted.
- Quizzes,
Midterm, and Final exam
- Some
unannounced quizzes will be given throughout the course. They are
designed such that students that do required readings and listen in
lecture will earn very high scores. Students that do not do required
readings and do not listen in lecture will likely receive much lower
scores.
- The midterm
and final exam are mandatory components of this course. Unfortunately,
no early or late exams are possible. If an unavoidable emergency
prevents your attendance at the midterm or final, you will be required
to submit written proof of the emergency and the make-up exam will
likely be given as an oral exam with the instructor.
- Individual work
and Dishonesty
- In
this course, all work must be done "individually"--meaning done
entirely by the student whose name is on the work. However, asking
other students conceptual questions and explaining high-level concepts
are important steps in the learning process and are strongly
encouraged. This is very different from giving or receiving aid related
to a specific assigned problem--which is not permitted. Copying someone
else's work or allowing your work to be copied in any setting (hwk,
quiz, exams, etc) does not promote learning, is unfair to honest
students, and WILL BE immediately reported to Student Judicial Affairs.
Students that observe inappropriate activity should report what they
see (anonymously if desired) to the TA or the instructor.
- Syllabus
- Introduction
to Computer Architecture (Ch 1)
- Instruction Set
Architecture (Ch 2)
- operations
- operands
- data vs
control flow
- Input/Output
- procedure calls
- compilers and
compiler optimizations
- Computer
Arithmetic (Ch 3)
- signed vs.
unsigned
- addition and
subtraction
- multiplication
- division
- floating point
operations
- Computer
Performance (Ch 4)
- methodology
and important factors
- benchmarks
- Data Path and
Control Unit (Ch 5)
- Building a
datapath
- multi-cycle
implementation
- designing a
control unit
- Micro
Programming
- integration
=> processor design
- Pipelining (Ch 6)
- pipelined
datapath
- pipelined
control
- data hazard
- control hazard
- exceptions
- Memory Hierarchy
(Ch 7)
- Cache
- Cache
performance
- Virtual Memory
- Memory
Hierarchy
- Peripherals and
I/O (Ch 8)