Computer Architecture CDA 4205 Spring 2014

Transcription

1

2 Computer Architecture CDA 4205 Spring 2014 Instructor: Dr. Matthew Morrison Office: ENB Website: Class: ENB am-9:15am TuTh. Office Hours: Monday and Wednesday: 1pm 2pm Other times can be arranged by appointment TA: Michal Galus Office Hours: ENB 325, MW 3:30-4:30pm. Text: Computer Organization and Design The Hardware/Software Interface David A. Patterson and John L. Hennessy, Morgan Kaufman, 4 th Edition Prerequisites: CDA 3201/L Logic Design and Lab with a grade of C- or better Grading: Percentages: Scale: Test 1 20% If Final Average > 90%, Grade = A Test 2 20% Else If Final Average > 80%, Grade = B Final 20% Else If Final Average > 70%, Grade = C Quizzes - 10% Else If Final Average > 60%, Grade = D Homework - 10% Else Grade = F Presentation 20% * Upward grade adjustments are possible depending on average and distribution of Final Class Averages for all students in the class. * The final exam is cumulative, though a heavy emphasis will be placed on the final 1/3 rd of the course material. Course Policies Attendance: Absences from class require appropriate written documentation from a physician, work supervisor, police report or major professor. The note must contain the reason for missing class, and must correlate to the date in question. Doctor s notes from after the date in question are not acceptable. Students are responsible for all information communicated in class. All lectures will be recorded using the Elluminate Live tool. This is to supplement your class notes for those who struggle to keep up with notes. They will also be very helpful for doing the TGOs and studying for exams. Homework: Topical Guide Objectives (TGOs) are due at the beginning of every class. They are a review of the previous day s material, and are meant to help you develop a study guide for exams and for preparing for job interviews upon graduation. They are to be hand-written (typed submissions receive an automatic 0 out of 10) Failure to earn a 70% average on TGOs will earn an automatic D or worse in the course, regardless of exam performance. Any homework not submitted by 8:00am without an or notification as to why they are late will receive an automatic 0 points (out of 10). I do not accept late homework without a valid excuse. If I have started lecture, please do not turn in your homework until I have completed lecture, at which point we will discuss whether or not I will accept your homework.

3 Quizzes: Quizzes will be unannounced, and 50% of the quiz grade will account for your attendance. The purpose of the quizzes is to give you a pressured environment where you can be honest with yourself as to your actual progress in learning the material. Presentations: The focus of this course is the MIPS instruction set architecture outlined in the course textbook. The last two weeks will consist of 12 student group presentations about a different architecture that you researched. Over the course of the semester, I will help each group develop their presentation. On the due dates, at least one group member will come to my office hours to discuss their progress and to get feedback. Also, by the time each milestone is reached, I will have presented the same material about MIPS, so you will have an idea of how to present the material. (Note, the percentages are the breakdown of the Presentation grade. For example, the Description of Datapath is 10% of the 20% Presentation, or 2% of the overall grade). * Group Selection of Architecture (5%) January 22 nd Your group will have chosen an architecture that you wish to present on. You should be able to tell me some basic information about the architecture, such as what purpose the engineer had in designing the architecture, some basic pros and cons of the architecture, and how you plan to get the information for the rest of the presentation (sources). * Description of Instruction Set (10%) February 5 th At this point in the semester, you will have a thorough understanding of what an instruction set is, and you will describe how the engineers chose it. * Description of Architecture Arithmetic (10%) February 19 th Every computer architecture requires a form of computing arithmetic in order to calculate values and memory addresses. * Description of Datapath (10%) March 5th How does the architecture pass along information from one place to another? Data Forwarding? Pipelining? How are hazards detected and prevented? And what is unique about this architecture * Description of Memory Hierarchy (10%) April 2 nd How does data get accessed? How does it get stored in the non-volatile memory? * Submission of Power Point by April 15 at 8am (5%) Each group, regardless of presentation date, must have their Powerpoint presentation ready no later than April 15 th at 8am. This is to ensure no group gets an unfair advantage. * Presentation (20%) 20 minute presentation, and there will be 5 minutes for questions. I expect each group member to participate in the verbal portion of the presentation. * Attendance for all presentations (5%) I expect that you attend all presentations, and will take attendance. Failure to attend all presentations without a valid excuse will result in an automatic 0 on the entire presentation grade. * Essay (25%) May 2 nd On the last day of final exams, you are to submit a 5-page report (in IEEE format, which I have posted on Canvas) comparing the 12 presented architectures. I will discuss later in more detail what I expect on this essay.

4 Course Objectives Impact of VLSI, RISC, Moore s Law Computing Performance Instruction Set Architecture design Processor Datapath and Control Design Memory Hierarchy, Cache and Virtual Memory Design Parallel Processing, Multicores Relevant Dates: Jan 10 Last Day to Drop with Fee Liability Feb 4 Exam 1 Mar Spring Break Mar 20 Exam 2 Mar 22 Last Day to Withdraw Without Academic Penalty Apr 10 Final Exam May 2 Final Paper Due Course Outline Week 1 (Jan 7, 9): Syllabus, Introduction, Performance, Week 2 (Jan 14, 16): Amdahl s Law, Instruction Set Architecture Week 3 (Jan 21, 23): Assembly, MIPS Computer Arithmetic Week 4 (Jan 28, 30): MIPS Computer Arithmetic, Exam Review Week 5 (Feb 4, 6): Exam 1, Single Cycle Datapath Week 6 (Feb 11, 13): Single Cycle Datapath, Pipelining Week 7 (Feb 18, 20): Pipelining, Exception Handling Week 8 (Feb 25, 27): Exceptions and Interrupts Week 9 (Mar 4, 6): Memory Hierarchy, Cache, Associativity *** SPRING BREAK MARCH 10-15, 2014 *** Week 10 (Mar 18, 20): Associativity Exam Review, Exam 2 Week 11 (Mar 25, 27): Parallel Processing (TLP vs ILP), Distributed Memory Week 12 (Apr 1, 3): Matrix Multiplication, Tomasulo s Algorithm Week 13 (Apr 8, 10): Final Exam Review, Final Exam Week 14 (Apr 15, 17): Presentations Week 15 (Apr 22, 24): Presentations Incompletes: A grade of I will be given only for a personal/family emergency. Religious Observances: We will be observing all university policies regarding religious holidays and disabilities. Students must discuss any missed coursework for religious observances by the second week of classes. Disabilities: Any student who has a disability is encouraged to meet with me privately during the first week of classes to discuss accommodations. The student must bring a current Memorandum of Accommodations from the Office of Student Disability Services. Academic Integrity Each student must work independently on all homework, quizzes, and tests. Please see the University's Undergraduate Catalog regarding these policies at Students caught cheating in any form will receive an FF grade for the course. USF defines cheating as using or attempting to use materials, information, notes, study aids, or other assistance in any type of examination or evaluation which have not been authorized by the instructor. I will make it very clear what you are or are not permitted to use. For example, my TGO policy is meant to prevent students for coercing another student into giving them their notes before an exam so they don t have to work hard. I am not trying to discourage collaboration. I am discouraging academic bullying.

5 Plagiarism is defined as intentionally or carelessly presenting the work of another as one s own. It includes submitting an assignment purporting to be the student s original work which has wholly or in part been created by another person. The policy continues by stating that every direct quotation must be identified by quotation marks or appropriate indentation and must be properly acknowledged by parenthetical citation in the text or in a footnote or endnote. As aspiring computing professionals, you are to approach academic integrity with the utmost sincerity. We have a responsibility to society to perform good, honest work. The public places their trust and well-being in you every time you do work. If you cheat, you have demonstrated that you are incapable and/or unwilling to meet this standard, and I will act accordingly. Your commitment to integrity is every bit as important, if not more so, than the grade you earn on your transcript.