Final Review Prof. Mike Schulte Advanced Computer Architecture ECE 401.

Slides:



Advertisements
Similar presentations
Lecture 8 Dynamic Branch Prediction, Superscalar and VLIW Advanced Computer Architecture COE 501.
Advertisements

A scheme to overcome data hazards
CPE 731 Advanced Computer Architecture ILP: Part V – Multiple Issue Dr. Gheith Abandah Adapted from the slides of Prof. David Patterson, University of.
CSE 490/590, Spring 2011 CSE 490/590 Computer Architecture VLIW Steve Ko Computer Sciences and Engineering University at Buffalo.
Topics covered: Memory subsystem CSE243: Introduction to Computer Architecture and Hardware/Software Interface.
Dynamic Branch PredictionCS510 Computer ArchitecturesLecture Lecture 10 Dynamic Branch Prediction, Superscalar, VLIW, and Software Pipelining.
1 Advanced Computer Architecture Limits to ILP Lecture 3.
Chapter 4 Advanced Pipelining and Intruction-Level Parallelism Computer Architecture A Quantitative Approach John L Hennessy & David A Patterson 2 nd Edition,
EECC551 - Shaaban #1 Fall 2005 lec# Static Compiler Optimization Techniques We examined the following static ISA/compiler techniques aimed.
Limits on ILP. Achieving Parallelism Techniques – Scoreboarding / Tomasulo’s Algorithm – Pipelining – Speculation – Branch Prediction But how much more.
3.13. Fallacies and Pitfalls Fallacy: Processors with lower CPIs will always be faster Fallacy: Processors with faster clock rates will always be faster.
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE Computer Organization Lecture 19 - Pipelined.
Instruction Level Parallelism (ILP) Colin Stevens.
EENG449b/Savvides Lec /17/04 February 17, 2004 Prof. Andreas Savvides Spring EENG 449bG/CPSC 439bG.
1  2004 Morgan Kaufmann Publishers Chapter Six. 2  2004 Morgan Kaufmann Publishers Pipelining The laundry analogy.
COMP381 by M. Hamdi 1 Superscalar Processors. COMP381 by M. Hamdi 2 Recall from Pipelining Pipeline CPI = Ideal pipeline CPI + Structural Stalls + Data.
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania Computer Organization Pipelined Processor Design 3.
Advanced Computer Architecture 5MD00 / 5Z033 Overview Henk Corporaal TUEindhoven 2009.
Csci4203/ece43631 Review Quiz. 1)It is less expensive 2)It is usually faster 3)Its average CPI is smaller 4)It allows a faster clock rate 5)It has a simpler.
Final Exam Review B. Ramamurthy. Date, Time and Place Date: Tuesday May 5, 2009 Time: AM Place: Filmore 170 Please bring pens, pencils, calculator.
Lecture 41: Review Session #3 Reminders –Office hours during final week TA as usual (Tuesday & Thursday 12:50pm-2:50pm) Hassan: Wednesday 1pm to 4pm or.
1 Computer Engineering Department Islamic University of Gaza ECOM 6301: Selected Topics in Computer Architectures (Graduate Course) Fall Prof.
Ch2. Instruction-Level Parallelism & Its Exploitation 2. Dynamic Scheduling ECE562/468 Advanced Computer Architecture Prof. Honggang Wang ECE Department.
Hardware Support for Compiler Speculation
Spring 2003CSE P5481 VLIW Processors VLIW (“very long instruction word”) processors instructions are scheduled by the compiler a fixed number of operations.
1 Advanced Computer Architecture Dynamic Instruction Level Parallelism Lecture 2.
Chapter 8 CPU and Memory: Design, Implementation, and Enhancement The Architecture of Computer Hardware and Systems Software: An Information Technology.
1 Lecture 5 Overview of Superscalar Techniques CprE 581 Computer Systems Architecture, Fall 2009 Zhao Zhang Reading: Textbook, Ch. 2.1 “Complexity-Effective.
Spring 2003CSE P5481 Midterm Philosophy What the exam looks like. Definitions, comparisons, advantages & disadvantages what is it? how does it work? why.
CIS 662 – Computer Architecture – Fall Class 16 – 11/09/04 1 Compiler Techniques for ILP  So far we have explored dynamic hardware techniques for.
CSCE 614 Fall Hardware-Based Speculation As more instruction-level parallelism is exploited, maintaining control dependences becomes an increasing.
1 Processor Architecture Jurij Silc, Borut Robic, Theo Ungerer.
CS5222 Adv. Comp. Arch. Part 0 Page.1 Chi C.H. Fall 2003 NUS CS5222 Advanced Computer Architecture Part 0: Course Introduction Fall Term, 2003/2004 Chi.
Chapter 6 Pipelined CPU Design. Spring 2005 ELEC 5200/6200 From Patterson/Hennessey Slides Pipelined operation – laundry analogy Text Fig. 6.1.
1 CPRE 585 Term Review Performance evaluation, ISA design, dynamically scheduled pipeline, and memory hierarchy.
Lecture 0. Course Introduction Prof. Taeweon Suh Computer Science Education Korea University COM515 Advanced Computer Architecture.
1 Introduction ELG 6158 Digital Systems Architecture Miodrag Bolic.
CS5222 Adv. Comp. Arch. Part 0 Page.1 Chi C.H. Fall 2004 NUS CS5222 Advanced Computer Architecture Part 0: Course Introduction Fall Term, 2004/2005 Chi.
Lecture 17 Final Review Prof. Mike Schulte Computer Architecture ECE 201.
1 Lecture 12: Advanced Static ILP Topics: parallel loops, software speculation (Sections )
Lecture 1: Introduction Instruction Level Parallelism & Processor Architectures.
Page 1 Computer Architecture and Organization 55:035 Final Exam Review Spring 2011.
Lecture 0. Course Introduction Prof. Taeweon Suh Computer Science Education Korea University COM515 Advanced Computer Architecture.
CPE432: Computer Design Course Introduction Dr. Gheith Abandah د. غيث علي عبندة.
High Performance Computing1 High Performance Computing (CS 680) Lecture 2a: Overview of High Performance Processors * Jeremy R. Johnson *This lecture was.
Lecture 1: Introduction CprE 585 Advanced Computer Architecture, Fall 2004 Zhao Zhang.
COEN 6741 Grading Scheme ► Test#1: 30% ► Test#2: 30% ► Project: 40%
Instruction-Level Parallelism and Its Dynamic Exploitation
Computer Architecture Principles Dr. Mike Frank
Dynamic Branch Prediction
The University of Adelaide, School of Computer Science
The University of Adelaide, School of Computer Science
Computer Architecture Principles Dr. Mike Frank
CS203 – Advanced Computer Architecture
Chapter 14 Instruction Level Parallelism and Superscalar Processors
Course Overview.
/ Computer Architecture and Design
Lecture 10 Tomasulo’s Algorithm
Computer Architecture Lecture 4 17th May, 2006
Chapter 5 Memory CSE 820.
CS 704 Advanced Computer Architecture
Coe818 Advanced Computer Architecture
Virtual Memory Overcoming main memory size limitation
Midterm 2 review Chapter
Overview Prof. Eric Rotenberg
Dynamic Hardware Prediction
Advanced Computer Architecture 5MD00 / 5Z033 Overview
The University of Adelaide, School of Computer Science
Procedure Return Predictors
Presentation transcript:

Final Review Prof. Mike Schulte Advanced Computer Architecture ECE 401

Final Review Material Covered –Chapters 1-3 of textbook (about 30%) –Chapters 4 and 5 - of textbook (about 70%) –Associated homework problems –3 research articles »Instruction Issue Logic for High-Performance Interruptable Pipelined Processors (CH3) »Complexity-effective Superscalar Processors (CH4) »Virtual Memory in Contemporary Microprocessors (CH5) Format –Open everything (notes, books, papers, calculator) –3 hours to complete - Dec 18, 8:00 to 11:00 AM, PL 466 –5 to 10 questions (multiple parts) –Similar to ECE401 midterm

Advanced Pipelining and ILP Important material from Chapter 4 includes –Pipeline scheduling and loop unrolling –Dependencies (data, name, control) –Dynamic scheduling (scoreboarding and Tomasulo) –Dynamic branch prediction (BHT, correlating predictors, branch target buffers) –Multiple instruction issue (Superscalar and VLIW) –Compiler support for ILP (software pipelining, eliminating dependencies) –Hardware support for ILP (poison bits, conditional instructions, hardware speculation) –Limits to ILP –The PowerPC 620

Memory Hierarchy Design Cache Design - block size, associativity, replacement policy, write policy. Cache Performance - AMAT Techniques for reducing –cache misses –miss penalty –hit time Main memory design Virtual memory - paging and segmentation Alpha APX memory hierarchy