EECS 318 CAD Computer Aided Design LECTURE 2: DSP Architectures Instructor: Francis G. Wolff Case Western Reserve University This presentation.

Slides:

Advertisements

Similar presentations

PipelineCSCE430/830 Pipeline: Introduction CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Prof. Yifeng Zhu, U of Maine Fall,

Advertisements

OMSE 510: Computing Foundations 4: The CPU!

Pipelining I Topics Pipelining principles Pipeline overheads Pipeline registers and stages Systems I.

Pipeline and Vector Processing (Chapter2 and Appendix A)

Chapter 8. Pipelining.

Review: Pipelining. Pipelining Laundry Example Ann, Brian, Cathy, Dave each have one load of clothes to wash, dry, and fold Washer takes 30 minutes Dryer.

Pipelining I (1) Fall 2005 Lecture 18: Pipelining I.

Pipelining Hwanmo Sung CS147 Presentation Professor Sin-Min Lee.

ENGS 116 Lecture 41 Instruction Set Design Part II Introduction to Pipelining Vincent H. Berk September 28, 2005 Reading for today: Chapter 2.1 – 2.12,

Computer Architecture

CS252/Patterson Lec 1.1 1/17/01 Pipelining: Its Natural! Laundry Example Ann, Brian, Cathy, Dave each have one load of clothes to wash, dry, and fold Washer.

1 5.1 Pipelined Computations. 2 Problem divided into a series of tasks that have to be completed one after the other (the basis of sequential programming).

inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 28 – CPU Design : Pipelining to Improve Performance The College Board.

CS61C L29 CPU Design : Pipelining to Improve Performance (1) Garcia, Spring 2007 © UCB Wirelessly recharge batt  Powercast & Philips have developed a.

Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania Computer Organization Pipelined Processor Design 1.

CS61C L28 CPU Design : Pipelining to Improve Performance I (1) Garcia, Fall 2006 © UCB 100 Msites!  Sometimes it’s nice to stop and reflect. The web was.

Computer ArchitectureFall 2007 © October 22nd, 2007 Majd F. Sakr CS-447– Computer Architecture.

CS61C L21 Pipeline © UC Regents 1 CS61C - Machine Structures Lecture 21 - Introduction to Pipelined Execution November 15, 2000 David Patterson

Pipelining Datapath Adapted from the lecture notes of Dr. John Kubiatowicz (UC Berkeley) and Hank Walker (TAMU)

CS430 – Computer Architecture Introduction to Pipelined Execution

1 COMP 206: Computer Architecture and Implementation Montek Singh Mon., Sep 9, 2002 Topic: Pipelining Basics.

1 Atanasoff–Berry Computer, built by Professor John Vincent Atanasoff and grad student Clifford Berry in the basement of the physics building at Iowa State.

Scott Beamer, Instructor

CS 61C L30 Introduction to Pipelined Execution (1) Garcia, Fall 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.

Computer ArchitectureFall 2008 © October 6th, 2008 Majd F. Sakr CS-447– Computer Architecture.

Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE Computer Organization Lecture 17 - Pipelined.

CS61C L19 Introduction to Pipelined Execution (1) Garcia, Fall 2005 © UCB Lecturer PSOE, new dad Dan Garcia inst.eecs.berkeley.edu/~cs61c.

Introduction to Pipelining Rabi Mahapatra Adapted from the lecture notes of Dr. John Kubiatowicz (UC Berkeley)

DSP markets. Typical DSP application 1982 TMS32010, TI introduces its first programmable general-purpose DSP to market Operating at 5 MIPS. It was.

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.

CS1104: Computer Organisation School of Computing National University of Singapore.

COMP381 by M. Hamdi 1 Pipelining Improving Processor Performance with Pipelining.

Integrated Circuits Costs

B 0000 Pipelining ENGR xD52 Eric VanWyk Fall

EEL5708 Lotzi Bölöni EEL 5708 High Performance Computer Architecture Pipelining.

Analogy: Gotta Do Laundry

CSCI-365 Computer Organization Lecture Note: Some slides and/or pictures in the following are adapted from: Computer Organization and Design, Patterson.

ECE 232 L18.Pipeline.1 Adapted from Patterson 97 ©UCBCopyright 1998 Morgan Kaufmann Publishers ECE 232 Hardware Organization and Design Lecture 18 Pipelining.

EECS 322 March 27, 2000 Based on Dave Patterson slides Instructor: Francis G. Wolff Case Western Reserve University This presentation.

CSIE30300 Computer Architecture Unit 04: Basic MIPS Pipelining Hsin-Chou Chi [Adapted from material by and

CS 61C L5.2.2 Pipelining I (1) K. Meinz, Summer 2004 © UCB CS61C : Machine Structures Lecture Pipelining I Kurt Meinz inst.eecs.berkeley.edu/~cs61c.

Pipelining Example Laundry Example: Three Stages

MS108 Computer System I Lecture 5 Pipeline Prof. Xiaoyao Liang 2015/3/27 1.

EECS 322 March 18, 2000 RISC - Reduced Instruction Set Computer Reduced Instruction Set Computer  By reducing the number of instructions that a processor.

Lecture 9. MIPS Processor Design – Pipelined Processor Design #1 Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System.

CMSC 611: Advanced Computer Architecture Pipelining Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted.

Chapter One Introduction to Pipelined Processors.

CSCI-365 Computer Organization Lecture Note: Some slides and/or pictures in the following are adapted from: Computer Organization and Design, Patterson.

Advanced Computer Architecture CS 704 Advanced Computer Architecture Lecture 10 Computer Hardware Design (Pipeline Datapath and Control Design) Prof. Dr.

BITS Pilani Pilani Campus Pawan Sharma Lecture / ES C263 INSTR/CS/EEE F241 Microprocessor Programming and Interfacing.

Lecture 3. Performance Prof. Taeweon Suh Computer Science & Engineering Korea University COSE222, COMP212, CYDF210 Computer Architecture.

DICCD Class-08. Parallel processing A parallel processing system is able to perform concurrent data processing to achieve faster execution time The system.

Lecture 5. MIPS Processor Design Pipelined MIPS #1 Prof. Taeweon Suh Computer Science & Engineering Korea University COSE222, COMP212 Computer Architecture.

Lecture 18: Pipelining I.

Pipelines An overview of pipelining

Review: Instruction Set Evolution

Chapter One Introduction to Pipelined Processors

ECE232: Hardware Organization and Design

Chapter 4 The Processor Part 2

Lecturer: Alan Christopher

Serial versus Pipelined Execution

Systems I Pipelining I Topics Pipelining principles Pipeline overheads

An Introduction to pipelining

Chapter 8. Pipelining.

8086 processor.

Pipelining Appendix A and Chapter 3.

A relevant question Assuming you’ve got: One washer (takes 30 minutes)

Presentation transcript:

EECS 318 CAD Computer Aided Design LECTURE 2: DSP Architectures Instructor: Francis G. Wolff Case Western Reserve University This presentation uses powerpoint animation: please viewshow

Instruction Pipelining is the use of pipelining to allow more than one instruction to be in some stage of execution at the same time. Ferranti ATLAS (1963):  Pipelining reduced the average time per instruction by 375%  Memory could not keep up with the CPU, needed a cache. Cache memory is a small, fast memory unit used as a buffer between a processor and primary memory Pipelining (Designing…,M.J.Quinn, ‘87)

Most high-performance computers exhibit a great deal of concurrency. However, it is not desirable to call every modern computer a parallel computer. Pipelining and parallelism are 2 methods used to achieve concurrency. Pipelining increases concurrency by dividing a computation into a number of steps. Parallelism is the use of multiple resources to increase concurrency. Pipelining versus Parallelism (Designing…,M.J.Quinn, ‘87)

Pipelining is Natural! ABCD Laundry Example Ann, Brian, Cathy, Dave each have one load of clothes to wash, dry, and fold Washer takes 30 minutes Dryer takes 30 minutes “Folder” takes 30 minutes “Stasher” takes 30 minutes to put clothes into drawers

Sequential Laundry 30 TaskOrderTaskOrder B C D A Time 30 6 PM AM Sequential laundry takes 8 hours for 4 loads If they learned pipelining, how long would laundry take?

Pipelined Laundry: Start work ASAP TaskOrderTaskOrder 12 2 AM 6 PM Time B C D A 30 Pipelined laundry takes 3.5 hours for 4 loads!

Pipelining Lessons Pipelining doesn’t help latency of single task, it helps throughput of entire workload Multiple tasks operating simultaneously using different resources Potential speedup = Number pipe stages Pipeline rate limited by slowest pipeline stage Unbalanced lengths of pipe stages reduces speedup Time to “fill” pipeline and time to “drain” it reduces speedup Stall for Dependences 6 PM 789 Time B C D A 30 TaskOrderTaskOrder

Registers Pipelining Cache memory Primary real memory Virtual memory (Disk, swapping) Faster Cheaper More Capacity Memory Hierarchy

Ideal Pipelining IFDCDEXMEMWB IFDCDEXMEMWB IFDCDEXMEMWB IFDCDEXMEMWB IFDCDEXMEMWB Assume instructions are completely independent! Maximum Speedup  Number of stages Speedup  Time for unpipelined operation Time for longest stage