Presentation is loading. Please wait.

Presentation is loading. Please wait.

Institute of Information Sciences and Technology Towards a Visual Notation for Pipelining in a Visual Programming Language for Programming FPGAs Chris.

Published byHubert Webb Modified over 8 years ago

Similar presentations

Presentation on theme: "Institute of Information Sciences and Technology Towards a Visual Notation for Pipelining in a Visual Programming Language for Programming FPGAs Chris."— Presentation transcript:

1 Institute of Information Sciences and Technology Towards a Visual Notation for Pipelining in a Visual Programming Language for Programming FPGAs Chris Johnston Supervisors: Donald Bailey, Paul Lyons Institute of Information Sciences and Technology Massey University, Palmerston North New Zealand

2 Institute of Information Sciences and Technology CHINZ July 2006 2 Outline Background to the problem Real time image processing using FPGAs Overview of VERTIPH Visual Environment for Real Time Image Processing in Hardware Visual notations for pipelining Pipelining is required to meet timing constraints Representing pipelining in a VPL Summary

3 Institute of Information Sciences and Technology CHINZ July 2006 3 Programmable hardware Configurable logic blocks (arbitrary logic functions) Programmable interconnects (routing switches) I/O RAM (Multipliers) (Processor cores) FPGA Architecture CLB RAMI/O CLB

4 Institute of Information Sciences and Technology CHINZ July 2006 4 Image processing Extracting information from or improving an Image

5 Institute of Information Sciences and Technology CHINZ July 2006 5 Why FPGAs? Image processing operations data intensive computationally expensive To do more work serial processors have to go faster FPGAs can process information in parallel FPGAs build custom hardware for each operation can be reconfigured as needs change

6 Institute of Information Sciences and Technology CHINZ July 2006 6 Hardware design is different from software design Issues With Programming FPGAs HardwareSoftware Parallelism All circuits activeParallelism through threads Resource sharing Need hardware arbitration Only one process running SpeedUse long pipelines, trade off with throughput Get a faster processor! (!)

7 Institute of Information Sciences and Technology CHINZ July 2006 7 Parallelism Temporal and spatial parallelism Function block Input data Output data Function block Register Function block Register Function block Register TemporalSpatial Input data Function block Register Output data Function block A pipeline Function block Input data Output data Function block Parallel operations Hybrid

8 Institute of Information Sciences and Technology CHINZ July 2006 8 Hardware Design Entry Schematic Handel-C code unsigned 1 x,y,z,C; par { C = x & y; z = x ^ y; } HLLs (High-level languages) VHDL code entity HA is port( x,y:in bit; z,C:out bit ); End HA; architecture BEHAVIOURAL of HA is begin C<=x and y; z<=x xor y; end HA; HDLs (Hardware description languages) Hard to reuse Not algorithmic Verbose Low level Very flexible Like software Higher level Have to work to a design model Increasing abstraction

9 Institute of Information Sciences and Technology CHINZ July 2006 9 Resource & scheduling FramePixelLinePixel VERTIPH Three Views of the System Architecture view If else If While Computational view

10 Institute of Information Sciences and Technology CHINZ July 2006 10 VERTIPH Shows components, data and control flow Allows for encapsulation of data structures and processes Architecture view Three Views of the System Barrel CorrectionKeyboard Interface Frame Buffer Manager RAM 1 RAM 2 Bilinear InterpolationVideo DriverCamera Interface Control flow Data flow (Architectural)

11 Institute of Information Sciences and Technology CHINZ July 2006 11 Barrel CorrectionKeyboard Interface Frame Buffer Manager RAM 1 RAM 2 Bilinear InterpolationVideo DriverCamera Interface Control flow Data flow Shows components, data and control flow Allows for encapsulation of data structures and processes Resource & scheduling FramePixelLinePixel VERTIPH Three Views of the System Architecture view If else If While Computational view

12 Institute of Information Sciences and Technology CHINZ July 2006 12 VERTIPH Three Views of the System Resource & scheduling FramePixelLinePixel Local and Global scheduling Avoids resource conflicts Shows when operations can run Architecture view If else If While Computational view (Resource & Scheduling)

13 Institute of Information Sciences and Technology CHINZ July 2006 13 Resource scheduling FramePixelLinePixel VERTIPH Three Views of the System Architecture view If else If While Computational view

14 Institute of Information Sciences and Technology CHINZ July 2006 14 While (true) If (videoScanX == VisibleCols) xc * xc sx xc x y + 1 y sy+2y+1 sy xadd sqrd x sx k y Kru1 Interpolated LUT mag correctx correcty Operators xadd: x + 1 sqrd: sx + 2x + 1 kru: (sx + sy) * k correctx: mag * x correcty: mag * y If (videoScanX == VisibleCols) xc * xc sx xc x y + 1 y sy+2y+1 sy Operators xadd: x + 1 sqrd: sx + 2x + 1 kru: (sx + sy) * k correctx: mag * x correcty: mag * y -3 Resource & scheduling FramePixelLinePixel If else If While Computational view VERTIPH Three Views of the System Architecture view Clock cycle (Computational)

15 Institute of Information Sciences and Technology CHINZ July 2006 15 Computational view shows concurrency, pipelining and latency no obvious way to show a pipeline Sequential Parallel If else If While Computational view VERTIPH Three Views of the System ABC Time B C Concurrency

16 Institute of Information Sciences and Technology CHINZ July 2006 16 illustrates the dataflow spacially inefficient shows that A, B & C run in separate clock cycles VERTIPH Pipelining notations Diagonal Gantt A B C

17 Institute of Information Sciences and Technology CHINZ July 2006 17 shows when all processors are active VERTIPH Pipelining notations Staggered Gantt A B C A B A

18 Institute of Information Sciences and Technology CHINZ July 2006 18 branching makes diagrams more complex cannot express multicycle pipelines VERTIPH Pipelining notations Staggered Gantt with Conditional Branching A C B B1B1 A B B1B1 A

19 Institute of Information Sciences and Technology CHINZ July 2006 19 VERTIPH A series of processors perform successive phases of a task processor passes data “down the line” when its phase is complete early processors accept more data while later ones handle early data A slider to change data interarrival times Notation is compact, but hides processor concurrency Pipelining notations Sequential Pipeline AB C C1C1 DEF

20 Institute of Information Sciences and Technology CHINZ July 2006 20 Pipelining notations Combines the benefits of Sequential and Gantt Bars indicate: phase, throughput & time when processors have valid data. VERTIPH Sequential Pipeline With Staggered Bars AB C C1C1 DEF

21 Institute of Information Sciences and Technology CHINZ July 2006 21 AB C C1C1 DEFAB C C1C1 DEF Pipelining notations VERTIPH Detailed bars show repeated hardware Staggered Sequential Pipeline With Staggered Bars extend clock lines down

22 Institute of Information Sciences and Technology CHINZ July 2006 22 Summary Staggered Gantt used too much screen space could not describe all options Sequential was not expressive enough Adding Staggered Bars gives an indication of data throughput Using Detailed Bars Balance between complexity and expressiveness. Shows hardware, phase and throughput

23 Institute of Information Sciences and Technology CHINZ July 2006 23 FIN

24 Institute of Information Sciences and Technology CHINZ July 2006 24 Computational

Download ppt "Institute of Information Sciences and Technology Towards a Visual Notation for Pipelining in a Visual Programming Language for Programming FPGAs Chris."

Similar presentations

Hao wang and Jyh-Charn (Steve) Liu

Hao wang and Jyh-Charn (Steve) Liu
Comparison of Altera NIOS II Processor with Analog Device’s TigerSHARC

Comparison of Altera NIOS II Processor with Analog Device’s TigerSHARC
Verilog Fundamentals Shubham Singh Junior Undergrad. Electrical Engineering.

Verilog Fundamentals Shubham Singh Junior Undergrad. Electrical Engineering.
Commercial FPGAs: Altera Stratix Family Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.

Commercial FPGAs: Altera Stratix Family Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
High Level Languages: A Comparison By Joel Best. 2 Sources The Challenges of Synthesizing Hardware from C-Like Languages  by Stephen A. Edwards High-Level.

High Level Languages: A Comparison By Joel Best. 2 Sources The Challenges of Synthesizing Hardware from C-Like Languages  by Stephen A. Edwards High-Level.
Implementation Approaches with FPGAs Compile-time reconfiguration (CTR) CTR is a static implementation strategy where each application consists of one.

Implementation Approaches with FPGAs Compile-time reconfiguration (CTR) CTR is a static implementation strategy where each application consists of one.
Survey of Reconfigurable Logic Technologies

Survey of Reconfigurable Logic Technologies
EELE 367 – Logic Design Module 2 – Modern Digital Design Flow Agenda 1.History of Digital Design Approach 2.HDLs 3.Design Abstraction 4.Modern Design Steps.

EELE 367 – Logic Design Module 2 – Modern Digital Design Flow Agenda 1.History of Digital Design Approach 2.HDLs 3.Design Abstraction 4.Modern Design Steps.
Hardwired networks on chip for FPGAs and their applications

Hardwired networks on chip for FPGAs and their applications
History TTL-logic PAL (Programmable Array Logic)

History TTL-logic PAL (Programmable Array Logic)
Team Morphing Architecture Reconfigurable Computational Platform for Space.

Team Morphing Architecture Reconfigurable Computational Platform for Space.
Lecture 26: Reconfigurable Computing May 11, 2004 ECE 669 Parallel Computer Architecture Reconfigurable Computing.

Lecture 26: Reconfigurable Computing May 11, 2004 ECE 669 Parallel Computer Architecture Reconfigurable Computing.
FPGA chips and DSP Algorithms By Emily Fabes. 2 Agenda FPGA Background Reasons to use FPGA’s Advantages and disadvantages of using FPGA’s Sample VHDL.

FPGA chips and DSP Algorithms By Emily Fabes. 2 Agenda FPGA Background Reasons to use FPGA’s Advantages and disadvantages of using FPGA’s Sample VHDL.
02/02/20091 Logic devices can be classified into two broad categories Fixed Programmable Programmable Logic Device Introduction Lecture Notes – Lab 2.

02/02/20091 Logic devices can be classified into two broad categories Fixed Programmable Programmable Logic Device Introduction Lecture Notes – Lab 2.
1 Hardware description languages: introduction intellectual property (IP) introduction to VHDL and Verilog entities and architectural bodies behavioral,

1 Hardware description languages: introduction intellectual property (IP) introduction to VHDL and Verilog entities and architectural bodies behavioral,
Define Embedded Systems Small (?) Application Specific Computer Systems.

Define Embedded Systems Small (?) Application Specific Computer Systems.
1/31/20081 Logic devices can be classified into two broad categories Fixed Programmable Programmable Logic Device Introduction Lecture Notes – Lab 2.

1/31/20081 Logic devices can be classified into two broad categories Fixed Programmable Programmable Logic Device Introduction Lecture Notes – Lab 2.
Introduction to Field Programmable Gate Arrays (FPGAs) COE 203 Digital Logic Laboratory Dr. Aiman El-Maleh College of Computer Sciences and Engineering.

Introduction to Field Programmable Gate Arrays (FPGAs) COE 203 Digital Logic Laboratory Dr. Aiman El-Maleh College of Computer Sciences and Engineering.
February 4, 2002 John Wawrzynek

February 4, 2002 John Wawrzynek
Configuration. Mirjana Stojanovic Process of loading bitstream of a design into the configuration memory. Bitstream is the transmission.

Configuration. Mirjana Stojanovic Process of loading bitstream of a design into the configuration memory. Bitstream is the transmission.

Similar presentations

Ads by Google