We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byTheodore Bartle
Modified about 1 year ago
superscalars Lalitha Ramadoss Elec 6200 Computer Architetcure& Design Lectured by Dr.Vishwani Agrawal Electrical&computer Engineering Auburn
What is a superscalar processor? Execute more than one instruction in each cycle Exploits Instruction level parallelism Motivation is Pipelining+Parallelism Better performance IBM RS/6000, TI SuperSPARC, the HP PA7100, and the DEC AXP 21064
Simple superscalar IFID INT FP MEMWB
Advanced Superscalars IF IF IF ID ID ID INT FP Lw/sw MEM MEM MEM WB WB WB
Instruction Level Parallelism Increasing the depth of pipeline to overlap more instructions-number of stages increased Replicating the internal components- multiple issue technique
Superscalar History Cray CDC 6600-1965 Intel i960CA-1988,AMD-29000(1990)- RISC P6 PentiumPro and PentiumII,Intel80386- CISC Power PC970
Superscalar concepts Scheduling Issues Execution Speculation WriteBack Retirement or Completion
Superscalar Classification Static Superscalars-execute instructions in program order Dynamic Superscalars-execute instructions out of order Dynamic with Speculation-ability to speculate on branches
Data Dependencies and Hazards Output Dependency MUL R1, R4, 15 ; R1 = R4 * 15 ADD R2, R1, 1 ; R2 = R1 + 1 MOVE R1, R3 ; R1 = R3 Antidependency ADD R1, R2, 1 ; R1 = R2 + 1 MOVE R2, R3 ; R2 = R3
Dynamic multiple issue processors Scheduling by Hardware l w $t0,20($s2) add $tl,$t0,$t2 sub $s4,$s4,$t3 Dynamic Pipeline scheduling
Dynamic scheduled Processors IF&ID RSRSRSRS IntInt FP FP Commit unit
References Computer Organization&Design Patterson Hennessy-2 & 3 edition http://www.cs.swan.ac.uk/~csneal/HPM/superscalar.html http://en.wikipedia.org/wiki/Superscalar http://www.ipp.mpg.de/de/for/bereiche/stellarator/Comp_s ci/CompScience/csep/csep1.phy.ornl.gov/ca/node25.htmlhttp://www.ipp.mpg.de/de/for/bereiche/stellarator/Comp_s ci/CompScience/csep/csep1.phy.ornl.gov/ca/node25.html
Superscalars (Dynamic Multiple issue processors) Yogesh Reddy Kondareddy 1.
Computer Architecture Lecture 3 – Part 2 15 th May, 2006 Abhinav Agarwal Veeramani V.
©UCB CS 162 Computer Architecture Lecture 1 Instructor: L.N. Bhuyan
Computer Architecture Lecture 2 Abhinav Agarwal Veeramani V.
Spring 2003CSE P5481 Instruction-Level Parallelism (ILP) Fine-grained parallelism Obtained by: instruction overlap in a pipeline executing instructions.
Computer Organization and Architecture Instruction Level Parallelism and Superscalar Processors Chapter 14.
William Stallings Computer Organization and Architecture 7 th Edition Chapter 14 Instruction Level Parallelism and Superscalar Processors.
Comp Sci pipelining 1 Ch. 13 Pipelining. Comp Sci pipelining 2 Pipelining.
ILP: IntroductionCSCE430/830 Instruction-level parallelism: Introduction CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Yifeng.
Lecture Objectives: 1)Define pipelining 2)Calculate the speedup achieved by pipelining for a given number of instructions. 3)Define how pipelining improves.
Chapter 2 Summary Classification of architectures Features that are relatively independent of instruction sets “Different” Processors –DSP and media processors.
\course\ELEG652-03Fall\Topic Exploitation of Instruction-Level Parallelism (ILP)
1 2004 Morgan Kaufmann Publishers Chapter Six. 2 2004 Morgan Kaufmann Publishers Pipelining The laundry analogy.
Chapter 14 William Stallings Computer Organization and Architecture 7 th Edition Instruction Level Parallelism and Superscalar Processors.
1 Lecture 5 Overview of Superscalar Techniques CprE 581 Computer Systems Architecture, Fall 2009 Zhao Zhang Reading: Textbook, Ch. 2.1 “Complexity-Effective.
Computer Organization and Architecture (AT70.01) Comp. Sc. and Inf. Mgmt. Asian Institute of Technology Instructor: Dr. Sumanta Guha Slide Sources: Based.
1 Lecture 5: Dependence Analysis and Superscalar Techniques Overview Instruction dependences, correctness, inst scheduling examples, renaming, speculation,
Spring 2008, Jan. 14 ELEC / Lecture 2 1 ELEC / Computer Architecture and Design Spring 2007 Introduction Vishwani D. Agrawal.
ELEN 468 Lecture 181 ELEN 468 Advanced Logic Design Lecture 18 MIPS Microprocessor.
PROCESSOR PIPELINING YASSER MOHAMMAD. SINGLE DATAPATH DESIGN.
Lecture 1: Introduction Instruction Level Parallelism & Processor Architectures.
Fall 2015, Aug 17 ELEC / Lecture 1 1 ELEC / Computer Architecture and Design Fall 2015 Introduction Vishwani D. Agrawal.
Introduction to Computer Organization Pipelining.
Superscalar processors Review. Dependence graph S1S2 Nodes: instructions Edges: ordered relations among the instructions Any ordering-based transformation.
10/24/05 ELEC62001 Kasi L.K. Anbumony Department of Electrical and Computer Engineering Auburn University Auburn, AL Superscalar Processors.
1 (Based on text: David A. Patterson & John L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, 3 rd Ed., Morgan Kaufmann,
Superscalar Implementation Simultaneously fetch multiple instructions Logic to determine true dependencies involving register values Mechanisms to communicate.
Oct. 18, 2000Machine Organization1 Machine Organization (CS 570) Lecture 4: Pipelining * Jeremy R. Johnson Wed. Oct. 18, 2000 *This lecture was derived.
Csci 136 Computer Architecture II – Superscalar and Dynamic Pipelining Xiuzhen Cheng
Lecture 1: Introduction CprE 585 Advanced Computer Architecture, Fall 2004 Zhao Zhang.
Spring 2016, Jan 13 ELEC / Lecture 1 1 ELEC / Computer Architecture and Design Spring 2016 Introduction Vishwani D. Agrawal.
ECE 252 / CPS 220 Pipelining Professor Alvin R. Lebeck Compsci 220 / ECE 252 Fall 2008.
Fall 2014, Nov ELEC / Lecture 12 1 ELEC / Computer Architecture and Design Fall 2014 Instruction-Level Parallelism.
Pipeline Computer Organization II 1 Hazards Situations that prevent starting the next instruction in the next cycle Structural hazards – A required resource.
CS252/Patterson Lec 1.1 1/17/01 معماري کامپيوتر - درس نهم pipeline برگرفته از درس : Prof. David A. Patterson.
1 Sixth Lecture: Chapter 3: CISC Processors (Tomasulo Scheduling and IBM System 360/91) Please recall: Multicycle instructions lead to the requirement.
Review for Quiz-1 Applied Operating System Concepts Patterson & Hennessy Chap.s 1,2,6,7 ECE3055b, Spring 2005
Instruction Level Parallelism ILP Advanced Computer Architecture CSE 8383 Spring /19/2004 Presented By: Sa’ad Al-Harbi Saeed Abu Nimeh.
Kevin Walsh CS 3410, Spring 2010 Computer Science Cornell University RISC Pipeline See: P&H Chapter 4.6.
Dynamic Branch PredictionCS510 Computer ArchitecturesLecture Lecture 10 Dynamic Branch Prediction, Superscalar, VLIW, and Software Pipelining.
Computing Systems Pipelining: enhancing performance.
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE Computer Organization Lecture 18 - Pipelined.
Chapter 6 Pipelined CPU Design. Spring 2005 ELEC 5200/6200 From Patterson/Hennessey Slides Pipelined operation – laundry analogy Text Fig. 6.1.
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.
1 COMP 206: Computer Architecture and Implementation Montek Singh Wed, Oct 19, 2005 Topic: Instruction-Level Parallelism (Multiple-Issue, Speculation)
+ William Stallings Computer Organization and Architecture 9 th Edition.
11 Pipelining Kosarev Nikolay MIPT Oct, Pipelining Implementation technique whereby multiple instructions are overlapped in execution Each pipeline.
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE Computer Organization Pipelined Processor.
© 2017 SlidePlayer.com Inc. All rights reserved.