Presentation is loading. Please wait.

Presentation is loading. Please wait.

PipeRoute: A Pipelining-Aware Router for FPGAs Akshay Sharma, Carl Ebeling* and Scott Hauck Electrical Engineering / *Computer Science & Engineering University.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "PipeRoute: A Pipelining-Aware Router for FPGAs Akshay Sharma, Carl Ebeling* and Scott Hauck Electrical Engineering / *Computer Science & Engineering University."— Presentation transcript:

1 PipeRoute: A Pipelining-Aware Router for FPGAs Akshay Sharma, Carl Ebeling* and Scott Hauck Electrical Engineering / *Computer Science & Engineering University of Washington Seattle, WA – 98195

2 2 Pipelined FPGA Architectures FPGAs and flexible computing But, max clock frequency? Examples of pipelined FPGAs RaPiD(Ebeling et al, 1996) HSRA(Tsu et al, 1999) UCSB(Singh et al, 2001) Few prominent features A fraction of (or all) switch-points are registered Registered LUT inputs Netlists heavily pipelined and retimed

3 3 Pipelined Routing PipeRoute – route netlists on pipelined FPGAs pipelined netlist provides information about register separation FPGA routing graph consists of R-nodes and D-nodes Cost of using an R-node or D-node in a route is the same as Pathfinder Pipelined routing problem differs from normal FPGA routing S T1T1 T2T2   

4 4 Normal Routing – Two Terminal Dijkstra’s shortest-path for two-terminal routing T S

5 5 Normal Routing – Two Terminal Dijkstra’s shortest-path for two-terminal routing T S

6 6 Normal Routing – Two Terminal Dijkstra’s shortest-path for two-terminal routing T S

7 7 Normal Routing – Two Terminal Dijkstra’s shortest-path for two-terminal routing T S

8 8 Normal Routing – Two Terminal Dijkstra’s shortest-path for two-terminal routing T S

9 9 Pipeline Routing – Two Terminal Find shortest route that goes through N registers (hereafter “registers” will be called “delays”) Traveling Salesman Find shortest route that goes through all nodes in a graph NP Complete  T S    

10 10 Two Terminal 1-Delay Router Can do optimal routing for 1-delay routes via Dijkstra  T S 

11 11 Two Terminal 1-Delay Router Can do optimal routing for 1-delay routes via Dijkstra  T S 

12 12 Two Terminal 1-Delay Router Can do optimal routing for 1-delay routes via Dijkstra  T S 

13 13 Two Terminal 1-Delay Router Can do optimal routing for 1-delay routes via Dijkstra  T S 

14 14 Two Terminal 1-Delay Router Can do optimal routing for 1-delay routes via Dijkstra  T S 

15 15 Two Terminal 1-Delay Router Can do optimal routing for 1-delay routes via Dijkstra  T S 

16 16 Two Terminal 1-Delay Router Can do optimal routing for 1-delay routes via Dijkstra  T S 

17 17 Two Terminal N-Delay Router Greedy Approximation via 1-Delay Router  T S    

18 18 Two Terminal N-Delay Router Greedy Approximation via 1-Delay Router Find 1-delay route  T S    

19 19 Two Terminal N-Delay Router Greedy Approximation via 1-Delay Router Find 1-delay route While not enough delay on route Replace any 0-delay segment with cheapest 1-delay replacement  T S    

20 20 Two Terminal N-Delay Router Greedy Approximation via 1-Delay Router Find 1-delay route While not enough delay on route Replace any 0-delay segment with cheapest 1-delay replacement  T S    

21 21 Two Terminal N-Delay Router Greedy Approximation via 1-Delay Router Find 1-delay route While not enough delay on route Replace any 0-delay segment with cheapest 1-delay replacement  T S    

22 22 Two Terminal N-Delay Router Greedy Approximation via 1-Delay Router Find 1-delay route While not enough delay on route Replace any 0-delay segment with cheapest 1-delay replacement  T S    

23 23 Normal Routing – Multi-Terminal Do two-terminal routing Use all of previous route(s) as source for next route T1T1 S T2T2

24 24 Normal Routing – Multi-Terminal Do two-terminal routing Use all of previous route(s) as source for next route T1T1 S T2T2

25 25 Multi-Terminal Router Sinks considered in increasing order of delay separation T1 is 2 delays away from S, and T2 is 3 delays away from S T1T1 S   T2T2   

26 26 Multi-Terminal Router Sinks considered in increasing order of delay separation T1 is 2 delays away from S, and T2 is 3 delays away from S T1T1 S T2T2     

27 27 Multi-Terminal Router Sinks considered in increasing order of delay separation T1 is 2 delays away from S, and T2 is 3 delays away from S Accumulate 1 delay at a time T1T1 S T2T2     

28 28 Multi-Terminal Router Sinks considered in increasing order of delay separation T1 is 2 delays away from S, and T2 is 3 delays away from S Accumulate 1 delay at a time When routing for an I delay, start from all existing routing at delay I and I-1 T1T1 S T2T2     

29 29 Multi-Terminal Router Sinks considered in increasing order of delay separation T1 is 2 delays away from S, and T2 is 3 delays away from S Accumulate 1 delay at a time When routing for an I delay, start from all existing routing at delay I and I-1 T1T1 S T2T2      1

30 30 Multi-Terminal Router Sinks considered in increasing order of delay separation T1 is 2 delays away from S, and T2 is 3 delays away from S Accumulate 1 delay at a time When routing for an I delay, start from all existing routing at delay I and I-1 T1T1 S T2T2     

31 31 Multi-Terminal Router Sinks considered in increasing order of delay separation T1 is 2 delays away from S, and T2 is 3 delays away from S Accumulate 1 delay at a time When routing for an I delay, start from all existing routing at delay I and I-1 T1T1 S T2T2      2

32 32 Multi-Terminal Router Sinks considered in increasing order of delay separation T1 is 2 delays away from S, and T2 is 3 delays away from S Accumulate 1 delay at a time When routing for an I delay, start from all existing routing at delay I and I-1 T1T1 S T2T2     

33 33 Multi-Terminal Router Sinks considered in increasing order of delay separation T1 is 2 delays away from S, and T2 is 3 delays away from S Accumulate 1 delay at a time When routing for an I delay, start from all existing routing at delay I and I-1 T1T1 S T2T2      3

34 34 Multi-Terminal Router Sinks considered in increasing order of delay separation T1 is 2 delays away from S, and T2 is 3 delays away from S Accumulate 1 delay at a time When routing for an I delay, start from all existing routing at delay I and I-1 T1T1 S T2T2     

35 35 Benchmark Architecture Modified RaPiD architecture 1-D datapath of 16-bit ALUs, Multipliers, registers and memories Pipelined interconnect structure Long and short tracks Bus Connectors used to pick up delay

36 36 Testing Benchmark RaPiD netlists Pipelining aware placement tool For each netlist Treat netlist as unpipelined and determine smallest RaPiD arch. (Zl) Determine smallest RaPiD arch. needed to route pipelined netlist (Zp) Pipelining cost = Zp/Zl

37 37 Results Avg pipelining cost incurred = 1.74

38 38 Results Effect of netlist-size on pipelining cost Normalized to unpipelined netlist area

39 39 Results Effect of % pipelined signals on pipelining cost Normalized to unpipelined circuit area

40 40 The Future Delay driven PipeRoute Currently under development Sophisticated pipelining-aware placement algorithms Fast pipelined routing algorithms Use PipeRoute to explore pipelined FPGA architectures Number and location of registered switch-points

Download ppt "PipeRoute: A Pipelining-Aware Router for FPGAs Akshay Sharma, Carl Ebeling* and Scott Hauck Electrical Engineering / *Computer Science & Engineering University."

Similar presentations

Architecture-Specific Packing for Virtex-5 FPGAs

Architecture-Specific Packing for Virtex-5 FPGAs
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.
Reconfigurable Computing (EN2911X, Fall07) Lecture 04: Programmable Logic Technology (2/3) Prof. Sherief Reda Division of Engineering, Brown University.

Reconfigurable Computing (EN2911X, Fall07) Lecture 04: Programmable Logic Technology (2/3) Prof. Sherief Reda Division of Engineering, Brown University.
School of Engineering & Technology Computer Architecture Pipeline.

School of Engineering & Technology Computer Architecture Pipeline.
Altera FLEX 10K technology in Real Time Application.

Altera FLEX 10K technology in Real Time Application.
Lecture 9: Coarse Grained FPGA Architecture October 6, 2004 ECE 697F Reconfigurable Computing Lecture 9 Coarse Grained FPGA Architecture.

Lecture 9: Coarse Grained FPGA Architecture October 6, 2004 ECE 697F Reconfigurable Computing Lecture 9 Coarse Grained FPGA Architecture.
TangP187_MAPLD2004 1 High-Performance SEE- Hardened Programmable DSP Array Larry McMurchie, Carl Sechen Students: Victor Tang, James Lan, Duncan Lam Dept.

TangP187_MAPLD High-Performance SEE- Hardened Programmable DSP Array Larry McMurchie, Carl Sechen Students: Victor Tang, James Lan, Duncan Lam Dept.
FPGA Latency Optimization Using System-level Transformations and DFG Restructuring Daniel Gomez-Prado, Maciej Ciesielski, and Russell Tessier Department.

FPGA Latency Optimization Using System-level Transformations and DFG Restructuring Daniel Gomez-Prado, Maciej Ciesielski, and Russell Tessier Department.
Caltech CS184a Fall2000 -- DeHon1 CS184a: Computer Architecture (Structures and Organization) Day17: November 20, 2000 Time Multiplexing.

Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day17: November 20, 2000 Time Multiplexing.
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.
Exploration of Pipelined FPGA Interconnect Structures Scott Hauck Akshay Sharma, Carl Ebeling University of Washington Katherine Compton University of.

Exploration of Pipelined FPGA Interconnect Structures Scott Hauck Akshay Sharma, Carl Ebeling University of Washington Katherine Compton University of.
ENGIN112 L38: Programmable Logic December 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 38 Programmable Logic.

ENGIN112 L38: Programmable Logic December 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 38 Programmable Logic.
Dynamic FPGA Routing for Just-in-Time Compilation Roman Lysecky a, Frank Vahid a*, Sheldon X.-D. Tan b a Department of Computer Science and Engineering.

Dynamic FPGA Routing for Just-in-Time Compilation Roman Lysecky a, Frank Vahid a*, Sheldon X.-D. Tan b a Department of Computer Science and Engineering.
Pipelining and Retiming 1 Pipelining  Adding registers along a path  split combinational logic into multiple cycles  increase clock rate  increase.

Pipelining and Retiming 1 Pipelining  Adding registers along a path  split combinational logic into multiple cycles  increase clock rate  increase.
The Spartan 3e FPGA. CS/EE 3710 The Spartan 3e FPGA  What’s inside the chip? How does it implement random logic? What other features can you use?  What.

The Spartan 3e FPGA. CS/EE 3710 The Spartan 3e FPGA  What’s inside the chip? How does it implement random logic? What other features can you use?  What.
Penn ESE680-002 Fall2007 -- DeHon 1 ESE680-002 (ESE534): Computer Organization Day 19: March 26, 2007 Retime 1: Transformations.

Penn ESE Fall DeHon 1 ESE (ESE534): Computer Organization Day 19: March 26, 2007 Retime 1: Transformations.
CS294-6 Reconfigurable Computing Day 2 August 27, 1998 FPGA Introduction.

CS294-6 Reconfigurable Computing Day 2 August 27, 1998 FPGA Introduction.
CS294-6 Reconfigurable Computing Day 16 October 15, 1998 Retiming.

CS294-6 Reconfigurable Computing Day 16 October 15, 1998 Retiming.
Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.

Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.
The Memory/Logic Interface in FPGA’s with Large Embedded Memory Arrays The Memory/Logic Interface in FPGA’s with Large Embedded Memory Arrays Steven J.

The Memory/Logic Interface in FPGA’s with Large Embedded Memory Arrays The Memory/Logic Interface in FPGA’s with Large Embedded Memory Arrays Steven J.

Similar presentations

Ads by Google