CSE 420/598: Computer Architecture (Fall 2008)

Lecture M, W 2:00 P.M. - 3:15 P.M. BYAC 150
Class No 73027, 85127
Instructor Sandeep Gupta
Office BY522
Email Sandeep.Gupta@asu.edu
Office Hours MW 3:30 P.M. - 5:00 P.M.
TA Su Jin Kim(su.kim@asu.edu)
TA Office BY517AD
TA Office Hour TTH 2:00 P.M. - 3:30 P.M. or by appointment


CONTENTS

ANNOUNCEMENT

  • The grades have been posted with your ASU ID. Please check your grades and contact the TA if you have any questions.

COURSE DESCRIPTION

Goal and Topics
Computer architecture. Performance versus cost tradeoffs. Instruction set design. Basic processor implementation and pipelining. Instruction-level parallelism and its exploitation. Multiprocessors and thread-level parallelism. Memory hierarchy design. Storage systems. (more course information)
Prerequisite: CSE330.

Grading
The following grading rubric will be used to evaluate all the submitted material and performance tasks:
A+: Student shows superior understanding of purpose and significance of the problem; is able to identify related problems; has solved the problem using novel approach and insight.
A: Student shows good understanding of purpose and significance of the problem; is able to identify related problems; has solved the problem displaying some degree of insight.
B: Student can solve the problem with some sophistication but is unable to judge its importance.
C: Student lacks understanding of how to approach the problem or proposes very naive solutions for the problem.

The final letter grade will be assigned based on weighted average of the grades obtained in the following categories:

Assignments : 40%
Quiz : 10%
Midterm Exam : 30%
Final Exam : 20%

Notice:
1) Assignments include written and programming assignments; knowledge of C and Assembly Language programming is assumed.
2) Quizzes can be unannounced.
3) Graduate students are expected to demonstrate a deeper understanding of the subject material. At times, graduate students will be assigned more challenging assignments and exam problems.

Notice: the above description is not finalized and subject to change. Student should check back this page on a regular basis.


ASSIGNMENT

Homework Points Date Assigned Due Date Files
    #1 Wed 09/17/2008 Wed 10/01/2008 HW1, Sample inputs and results, More test cases, Q&A
    #2 Wed 10/29/2008 Mon 11/10/2008 HW2, Test input 1, Test input 2
Sample files
In these results, the hit ratios are not correct. Please check only action traces.
    #3 Wed 11/05/2008 Mon 11/17/2008 HW3
    #4 Wed 11/05/2008 Wed 12/03/2008 package (a zip file)
HW4, Input1, Input2, Sample JAVA class for a paser,test1.dat, test2.dat, outputs for samples, note for test1.dat
Mid-term 2:oo-3:15 PM, Wed, Oct 15
Final exam 12:10-2:00 PM, Mon, Dec 15


LECTURE NOTES

Week Class # Date Topics Materials
2 1 08/25 Introduction to Class
2 08/27 Chapter 1. Fundamentals of Computer Design
2 3 09/03 Chapter 1. Fundamentals of Computer Design note
3 4 09/08 Chapter 1. Fundamentals of Computer Design Additional examples, Quiz1, Grades
5 09/10 Reviews of Quiz 1, Cost of an Integrated Circuit, Semiconductors note, semiconductors
4 6 09/15 Memory hierarchy and Virtual memory note, Quiz 2, Grades
7 09/17 Cache Performance note
5 8 09/22 Memory Hierarchy (Appendix C) slides
9 09/24 Cache Optimization and Motivation of Multiprocessors note, slides
6 10 09/29 Shared Memory Architectures in Multiprocessors notes, slides
11 10/01 Snooping and Directory-based Cache Coherence Protocols notes, slides
7 12 10/06 Directory-based Cache Coherence Protocols and Case Studies notes
13 10/08 Case Studies on Snooping Cache Protocol and Quiz 3 notes, Grades
8 14 10/13 Reviews of Quiz 3 and midterm notes
15 10/15 Midterm
9 16 10/20 Reviews of midterm
17 10/22 Reviews of take home exam Grades
10 18 10/27 Pipelining Basics slides
19 10/29 Pipelining - Appendix A slides
11 20 11/03 Quiz 4 Quiz 4
21 11/05 Pipelining - Design details slides
12 22 11/10 Pipelining - Hazards slides
23 11/12 Reviews of homework 3 and pipelining hw3
13 24 11/17 Solutions of homework 3
25 11/19 Midterm 2
14 26 11/24 Solutions of midterm 2
27 11/26 Reviews of pipelining simulators
15 28 12/01 Reviews of final Expected overall grades
29 12/03 Code Reviews of Homework 4
16 30 12/08 Reviews of smaple questions for final




REFERENCE

POLICY ON CHEATING

Any incidence of cheating in this class will be severely dealt with. This applies to homework assignments, programming assignments, quizzes and tests. The minimum penalty for cheating will be that the student will not obtain any credit for that particular assignment. (This means that if in a test and/or assignment a student is found have cheated, he/she will obtain zero in that test and/or assignment.) For the homework and the programming assignments students may discuss the problems with others, but one is expected to turn in the results of one's own effort (not the results of a friend's efforts). One tends to get very suspicious if two identically wrong results show up in the homework assignment and/or tests. The names of the offenders will be maintained in the departmental files. The repeat offenders may be debarred from the University.









Home | Projects | People | Publications | Courses | Resources | Contact