Spring 2012: CS/EE 6810 Computer Architecture
General Information:
- Venue: WEB 1230
- Time: Tuesday, Thursday 10:45am - 12:05pm
- Instructor: Rajeev Balasubramonian, email: rajeev@cs, MEB 3414, office hours: by appointment
- Pre-Requisite: CS 3810 or equivalent
- TA: Ali Shafiei, email: shafiee@cs, office: MEB 2180, Office hours: Monday 3-4pm (if an assignment is due on Thursday, office hours in that week will be Wednesday 3-4pm instead)
- Textbook: Computer Architecture A Quantitative Approach - 5th Edition, John Hennessy and David Patterson
- Class mailing list: cs6810@list.eng.utah.edu. Visit the mailman system to sign up or modify.
Prerequisites:
You are expected to know introductory computer architecture concepts,
such as those covered in CS 3810 (textbook for 3810: Computer Organization
and Design, Patterson and Hennessy, 5th edition). You will be well-served
to re-visit some of the basic concepts in the 3810 textbook before the
first day of class.
College of Engineering Add/Drop Policy:
Guidelines from the college.
Special Needs:
The University of Utah seeks to provide equal access to its programs,
services and activities for people with disabilities. If you will
need accommodations in the class, reasonable prior notice needs to be
given to the Center for Disability Services, 162 Olpin Union Building,
581-5020 (V/TDD). CDS will work with you and the instructor to make
arrangements for accommodations.
All written information in this course can be made available in
alternative format with prior notification to the Center for
Disability Services.
Grading:
The following is a tentative guideline and may undergo changes.
Two mid-term exams will count for 50% of the final grade.
The remaining 50% will be based on homework assignments.
We have zero tolerance for cheating -- if your class rank in the
assignments is significantly different from your class rank in
the exams, only your rank in the exams will count towards your
grade. We know you're juggling multiple activities and the
assignment deadline may not always be favorable. You are
therefore allowed to skip one of the assignments -- use
this freebie prudently. Late submissions will not be graded.
Class Schedule
Read the relevant sections in the textbook *before* the lecture.
Chapter 1: Quantitative Metrics
- Tu 10th Jan:
Logistics and introduction. Quantifying computer performance.
Reading: review the pre-req textbook for CS 3810: Computer Organization and Design, Patterson and Hennessy.
Reading: 6810 textbook: Sections 1.1-1.5, 1.8-1.10.
Slides:
(powerpoint)
(pdf)
- Th 12th Jan:
System Metrics.
Reading: Sections 1.5-1.10.
Homework: #1 handed out .
Slides:
(powerpoint)
(pdf)
- Tu 17th Jan:
Pipelining basics.
Reading: Sections C.1-C.4.
Slides:
(powerpoint)
(pdf)
- Th 19th Jan:
Advanced pipelining.
Reading: Sections C.4-C.8.
Slides:
(powerpoint)
(pdf)
- Tu 24th Jan:
Software ILP basics.
Reading: Sections C.5, 3.2.
Homework: #1 due.
Slides:
(powerpoint)
(pdf)
- Th 26th Jan: Class Canceled
Homework: #2 handed out .
- Tu 31st Jan:
Branch Handling.
Reading: Sections 3.2-3.3.
Slides:
(powerpoint)
(pdf)
- Th 2nd Feb:
No Class.
- Tu 7th Feb:
Branch prediction, Out-of-order processors.
Reading: Sections 3.3, Detailed Notes on Out-of-order execution.
Homework: #2 due.
Homework: #3 handed out .
Slides:
(powerpoint)
(pdf)
- Th 9th Feb:
More Dynamic ILP.
Reading:
Detailed Notes on Out-of-order execution
Slides:
(powerpoint)
(pdf)
- Tu 14th Feb:
Out of order implementations.
Reading: None.
Homework: #3 due.
Homework: #4 handed out .
Slides:
(powerpoint)
(pdf)
- Th 16th Feb:
Out of Order example.
Reading: Class notes.
Slides:
(powerpoint)
(pdf)
- Tu 21st Feb:
Caches.
Reading: Sections B.1-B.3, 2.1.
Slides:
(powerpoint)
(pdf)
- Th 23rd Feb:
Large Caches.
Reading: Section 2.2.
Homework: #4 due.
Slides:
(powerpoint)
(pdf)
- Tu 28th Feb:
Mid-Term Exam (open book, open notes), based on Chapters 1, 3, C.
- Th 1st Mar:
Large caches, VM and TLB.
Reading: Sections 2.4, B.4, B.5.
Slides:
(powerpoint)
(pdf)
- Tu 6th Mar:
Main memory system basics.
Reading: Section 2.3.
Slides:
(powerpoint)
(pdf)
- Th 8th Mar:
Main Memory Systems.
Reading: none.
Homework: #5 handed out .
Slides:
(powerpoint)
(pdf)
- Tu 13th Mar:
Spring Break.
- Th 15th Mar:
Spring Break.
- Tu 20th Mar:
Main memory innovations.
Reading: none.
Slides:
(powerpoint)
(pdf)
- Th 22nd Mar:
Multiprocessor intro.
Reading: Sections 5.1.-5.4.
Homework: #5 due.
Homework: #6 handed out .
Slides:
(powerpoint)
(pdf)
- Tu 27th Mar:
Symmetric shared-memory architectures.
Reading: Sections 5.1.-5.3.
Slides:
(powerpoint)
(pdf)
- Th 29th Mar:
Distributed shared-memory architectures, Synchronization.
Reading: Section 5.4-5.5.
Slides:
(powerpoint)
(pdf)
- Tu 3rd Apr:
Guest lecture, Al Davis. Topic: Datacenters.
Reading: Chapter 6.
Slides:
(powerpoint)
(pdf)
(photonics slides powerpoint)
- Th 5th Apr:
Synchronization, Consistency models.
Reading: Sections 5.5-5.7.
Homework: #6 due.
Slides:
(powerpoint)
(pdf)
- Tu 10th Apr:
Consistency, Transactional Memory.
Homework: #7 handed out .
Slides:
(powerpoint)
(pdf)
- Th 12th Apr:
Transactional Memory.
Slides:
(powerpoint)
(pdf)
- Tu 17th Apr:
Interconnection networks.
Reading: Appendix F.
Slides:
(powerpoint)
(pdf)
- Th 19th Apr:
Interconnection networks.
Reading: None
Homework: #7 due.
Slides:
(powerpoint)
(pdf)
- Tu 24th Apr:
Networks, Storage.
Reading: Appendix D
Slides:
(powerpoint)
(pdf)
- Mo 30th Apr: 10:30am-12:30pm
Final Exam (open book, open notes), based primarily on Caches, Memory systems, Multiprocessors, Transactional Memory, Datacenters, Interconnection Networks, Storage.