Extra Reading Data-Instruction Stream : Flynn

Slides:

Advertisements

Similar presentations

PIPELINING AND VECTOR PROCESSING

Advertisements

PIPELINE AND VECTOR PROCESSING

UNIT-III PIPELINING AND I/O ORGANISATION

School of Engineering & Technology Computer Architecture Pipeline.

Computer Architecture Vector Architectures Ola Flygt Växjö University

Lecture 11 Oct 12 Circuits for floating-point operations addition multiplication division (only sketchy)

Computer Organization CS224 Fall 2012 Lesson 19. Floating-Point Example  What number is represented by the single-precision float …00 

1 EE24C Digital Electronics Project Theory: Sequential Logic (part 2)

Chapter 9 Computer Design Basics. 9-2 Datapaths Reminding A digital system (or a simple computer) contains datapath unit and control unit. Datapath: A.

Computer System Architecture Dept. of Info. Of Computer Chap. 9 Pipeline and Vector Processing 9-1 Chap. 9 Pipeline and Vector Processing n 9-1 Parallel.

C SINGH, JUNE 7-8, 2010IWW 2010, ISATANBUL, TURKEY Advanced Computers Architecture, UNIT 1 Advanced Computers Architecture Lecture 4 By Rohit Khokher Department.

1/8/ L24 IEEE Floating Point Basics Copyright Joanne DeGroat, ECE, OSU1 IEEE Floating Point The IEEE Floating Point Standard and execution.

©2004 Brooks/Cole FIGURES FOR CHAPTER 18 CIRCUITS FOR ARITHMETIC OPERATIONS Click the mouse to move to the next page. Use the ESC key to exit this chapter.

5-Stage Pipelining Fetch Instruction (FI) Fetch Operand (FO) Decode Instruction (DI) Write Operand (WO) Execution Instruction (EI) S3S3 S4S4 S1S1 S2S2.

Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.

1/8/ L24 IEEE Floating Point Basics Copyright Joanne DeGroat, ECE, OSU1 IEEE Floating Point The IEEE Floating Point Standard and execution.

Pipeline And Vector Processing. Parallel Processing The purpose of parallel processing is to speed up the computer processing capability and increase.

9.2 Pipelining Suppose we want to perform the combined multiply and add operations with a stream of numbers: A i * B i + C i for i =1,2,3,…,7.

CSCI 6307 Foundation of Systems – Exercise (2) Xiang Lian The University of Texas – Pan American Edinburg, TX

PIPELINING AND VECTOR PROCESSING

Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 January Session 3.

Speeding up of pipeline segments © Fr Dr Jaison Mulerikkal CMI.

Pipelining Enhancing Performance. Datapath as Designed in Ch. 5 Consider execution of: lw $t1,100($t0) lw $t2,200($t0) lw $t3,300($t0) Datapath segments.

Pipeline Hazards. CS5513 Fall Pipeline Hazards Situations that prevent the next instructions in the instruction stream from executing during its.

1 Pipelining and Vector Processing Computer Organization Computer Architectures Lab PIPELINING AND VECTOR PROCESSING Parallel Processing Pipelining Arithmetic.

Principles of Linear Pipelining

1/8/ L24 IEEE Floating Point Basics Copyright Joanne DeGroat, ECE, OSU1 IEEE Floating Point The IEEE Floating Point Standard and execution.

Principles of Linear Pipelining. In pipelining, we divide a task into set of subtasks. The precedence relation of a set of subtasks {T 1, T 2,…, T k }

Chapter One Introduction to Pipelined Processors

Floating Point in Binary 1.Place Value Chart:

Reconfigurable Computing - Options in Circuit Design John Morris Chung-Ang University The University of Auckland ‘Iolanthe’ at 13 knots on Cockburn Sound,

Introduction  The speed of execution of program is influenced by many factors. i) One way is to build faster circuit technology to build the processor.

Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 January Session 2.

Computer Architecture Lecture 11 Arithmetic Ralph Grishman Oct NYU.

Principles of Linear Pipelining

Speedup Speedup is defined as Speedup = Time taken for a given computation by a non-pipelined functional unit Time taken for the same computation by a.

Chapter One Introduction to Pipelined Processors.

By Wannarat Computer System Design Lecture 3 Wannarat Suntiamorntut.

Principles of pipelining The two major parametric considerations in designing a parallel computer architecture are: –executing multiple number of instructions.

Arithmetic for Computers Chapter 3 1. Arithmetic for Computers  Operations on integers  Addition and subtraction  Multiplication and division  Dealing.

UNIT-V PIPELINING & VECTOR PROCESSING.

Computer System Design Lecture 3

CHAPTER 18 Circuits for Arithmetic Operations

PARALLEL COMPUTER ARCHITECTURE

Integer Division.

Computer Design Basics

Floating Point Operations

Expressible Numbers.

Lecture 16 Arithmetic Circuits

Outline Introduction Floating Point Arithmetic Adder Multiplier.

Pipelining and Vector Processing

Data Representation and Arithmetic Algorithms

The IEEE Floating Point Standard and execution units for it

Arithmetic Logical Unit

Multiprocessor & Multicomputer

Overview Parallel Processing Pipelining

Chap. 9 Pipeline and Vector Processing

Data Representation and Arithmetic Algorithms

Starter Using the fingers on only one hand, what is the highest number you can count to? Rules: You must start at 1 You must count sequentially (i.e.

Computer Design Basics

Pipelining: Basic Concepts

COMPUTER ARCHITECTURES FOR PARALLEL ROCESSING

LOGIC Circuits.

CHAPTER 18 Circuits for Arithmetic Operations

The IEEE Floating Point Standard and execution units for it

COMPUTER ORGANIZATION AND ARCHITECTURE

Unit-2 CENTRAL PROCESSING UNIT. CISC In the 1970’s, memory was expansive and small in size,so people designed computers that would pack as many action.

Chapter 1 Introduction.

Presentation transcript:

Extra Reading Data-Instruction Stream : Flynn Computer Architectural Classification Data-Instruction Stream : Flynn Serial versus Parallel Processing : Feng Parallelism and Pipelining : Händler

Speedup S : Nonpipeline / Pipeline S = n • tn / ( k + n - 1 ) • tp = 6 • 6 tn / ( 4 + 6 -1 ) • tp = 36 tn / 9 tn = 4 n : task number ( 6 ) tn : time to complete each task in nonpipeline ( 6 cycle times = 6 tp) tp : clock cycle time ( 1 clock cycle ) k : segment number ( 4 ) Pipeline= 9 clock cycles General considerations 4 segment pipeline : Fig. 9-3 S : Combinational circuit for Suboperation R : Register(intermediate results between the segments) Space-time diagram : Fig. 9-4 Show segment utilization as a function of time Task : T1, T2, T3,…, T6 Total operation performed going through all the segment

4 segments suboperations 1) Compare exponents by subtraction : Floating-point Adder Pipeline Example : Fig. 9-6 Add / Subtract two normalized floating-point binary number X = A x 2a = 0.9504 x 103 Y = B x 2b = 0.8200 x 102 4 segments suboperations 1) Compare exponents by subtraction : 3 - 2 = 1 X = 0.9504 x 103 Y = 0.8200 x 102 2) Align mantissas Y = 0.08200 x 103 3) Add mantissas Z = 1.0324 x 103 4) Normalize result Z = 0.1324 x 104