Presentation is loading. Please wait.

Presentation is loading. Please wait.

FPGA Switch Block Design Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.

Published byTheodora Harvey Modified over 9 years ago

Similar presentations

Presentation on theme: "FPGA Switch Block Design Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223."— Presentation transcript:

1 FPGA Switch Block Design Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223

2 FPGA Architecture (Recap)

3 Routing Instance and an S Block

4 Flexibility of Interconnection Structures for Field- Programmable Gate Arrays J. Rose and S. Brown, IEEE Journal of Solid-State Circuits 25(3): 277-282, Mar. 1991

5 Key Questions What is the effect of C Block flexibility on routing completion rate? What is the effect of S Block flexibility on routing completion rate? How do S and C Block flexibilities interact? What is the effect of S and C Block flexibilities on the number of tracks per channel to achieve 100% routability?

6 Switch Block Flexibility Total number of possible connections offered to each incoming wire

7 Switch Block Routability Cannot route from A to B Can route from A to B – Assymmetric about horizontal and vertical axes F s = 2

8 Example Connection Block

9 Routability Study (One Benchmark) W = 14 Increasing F S improves routability, but F C must be high to achieve 100% routability Routing completion rate approaches 100% when F C > ½W Routing completion rate is low for low values of F C

10 Routability Study (One Benchmark) W = 14 If F C is high enough, then low values of F S can achieve 100% routability The number of different paths between the initial physical pin and the terminating C Block of a two- pin wire is given by: where N is the number of S Blocks on the global path For lower values of F C, increasing F S improves routability up to a point

11 S Block vs. C Block Flexibility Avg. F C /W for 100% routing completion A more flexible S Block can compensate for a less flexible C Block

12 Track Count Requirement for BNRE to Achieve 100% Routability

13 Conclusion C Blocks should have high flexibility to achieve high-percentage routing completion S Blocks require limited flexibility With low flexibility, only a few extra tracks more than the minimum can achieve 100% routability

14 Universal Switch Modules for FPGA Design Y-W. Chang et al., ACM Transactions on Design Automation for Electronic Systems 1(1): 80-101, Jan. 1996

15 Overview A Switch Block with larger routing capacity has better area-performance in FPGA routing – Increased connectivity of routing components – Equivalence of LUT/CLB inputs permits pin permutations, which yields highly optimal routing – Most nets are short 60% of nets route through at most 2 Switch Blocks 90% of nets route through at most 5 Switch Blocks Tradeoff between routing capacity and area

16 Universal Switch Module Definition Routing Resource Vector (RRV): N = (n 1, n 2, n 3, n 4, n 5, n 6 ), 0 < n i < W Example: N = (1, 0, 1, 1, 0, 0) is routable on the following: n1n1 n4n4 n3n3 A Switch Block of size W is universal if the following inequalities are sufficient to determine of an RRV is routable:

17 Examples

18 Universal Sub-modules A sub-module of a Universal switch is also universal (but for a smaller W)

19 Theoretical Results A universal S Block can be constructed with at least 6W switches Any S Block constructed with less than 6W switches cannot be universal

20 Non-universal S Blocks Disjoint Switch Block (Xilinx XC4000 series) Antisymmetric Switch Block (Rose and Brown, 1991)

21 Channel Width Required for 100% Routing Capacity (One Benchmark)

22 Conclusion Universal S Blocks offer better routability than disjoint and antisymmetric S Blocks Algorithm presented to generate S Blocks that are universal (not discussed)

23 Architectures and Algorithms for Field-Programmable Gate Arrays with Embedded Memory S. Wilton, Ph.D. Thesis, University of Toronto, 1997 (Section 6.1.2)

24 S Blocks DisjointUniversalWilton Start with Universal S Block, and rotate the diagonal connections by one track

25 FPGA Routing Structures: A Novel Switch Block and Depopulated Interconnect Matrix Architectures M. I. Masud, M.S. Thesis, University of British Columbia, 1998

26 Routing with a Disjoint S Block Routing fabric partitioned into domains Cannot cross domains (using routing only)

27 Routing with a Wilton S Block Eliminates domain choice problem Many more routing choices are available

28 Implementation Details Wilton Disjoint Wilton Disjoint Area Overhead

29 Imran S Block Routability of Wilton S Block Implementation efficiency of Disjoint S Block

30 Imran S Block (1)Tracks that terminate at the S Block Wilton topology (2)Tracks that pass through the S Block Disjoint topology

31 Area Results

32 Delay Results

33 Channel Width Results

34 Conclusion Imran Switch Block – Routability of Wilton Switch Block – Area-efficiency of Disjoint Switch Block

Download ppt "FPGA Switch Block Design Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223."

Similar presentations

ECE 506 Reconfigurable Computing ece. arizona

ECE 506 Reconfigurable Computing ece. arizona
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.
FPGA Intra-cluster Routing Crossbar Design Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.

FPGA Intra-cluster Routing Crossbar Design Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
FPGA Technology Mapping Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.

FPGA Technology Mapping Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
EECE579: Digital Design Flows

EECE579: Digital Design Flows
Zheming CSCE715.  A wireless sensor network (WSN) ◦ Spatially distributed sensors to monitor physical or environmental conditions, and to cooperatively.

Zheming CSCE715.  A wireless sensor network (WSN) ◦ Spatially distributed sensors to monitor physical or environmental conditions, and to cooperatively.
Lecture 2: Field Programmable Gate Arrays I September 5, 2013 ECE 636 Reconfigurable Computing Lecture 2 Field Programmable Gate Arrays I.

Lecture 2: Field Programmable Gate Arrays I September 5, 2013 ECE 636 Reconfigurable Computing Lecture 2 Field Programmable Gate Arrays I.
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.
Caltech CS184a Fall2000 -- DeHon1 CS184a: Computer Architecture (Structures and Organization) Day8: October 18, 2000 Computing Elements 1: LUTs.

Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day8: October 18, 2000 Computing Elements 1: LUTs.
Penn ESE535 Spring 2009 -- DeHon 1 ESE535: Electronic Design Automation Day 21: April 15, 2009 Routing 1.

Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 21: April 15, 2009 Routing 1.
VLSI Routing. Routing Problem  Given a placement, and a fixed number of metal layers, find a valid pattern of horizontal and vertical wires that connect.

VLSI Routing. Routing Problem  Given a placement, and a fixed number of metal layers, find a valid pattern of horizontal and vertical wires that connect.
Build-In Self-Test of FPGA Interconnect Delay Faults Laboratory for Reliable Computing (LaRC) Electrical Engineering Department National Tsing Hua University.

Build-In Self-Test of FPGA Interconnect Delay Faults Laboratory for Reliable Computing (LaRC) Electrical Engineering Department National Tsing Hua University.
Penn ESE680-002 Spring2007 -- DeHon 1 ESE680-002 (ESE534): Computer Organization Day 11: February 14, 2007 Compute 1: LUTs.

Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 11: February 14, 2007 Compute 1: LUTs.
Penn ESE535 Spring 2008 -- DeHon 1 ESE535: Electronic Design Automation Day 19: April 9, 2008 Routing 1.

Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 19: April 9, 2008 Routing 1.
CS294-6 Reconfigurable Computing Day 14 October 7/8, 1998 Computing with Lookup Tables.

CS294-6 Reconfigurable Computing Day 14 October 7/8, 1998 Computing with Lookup Tables.
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.
CS 151 Digital Systems Design Lecture 38 Programmable Logic.

CS 151 Digital Systems Design Lecture 38 Programmable Logic.
1 DIGITAL DESIGN I DR. M. MAROUF FPGAs AUTHOR J. WAKERLY.

1 DIGITAL DESIGN I DR. M. MAROUF FPGAs AUTHOR J. WAKERLY.
General FPGA Architecture Field Programmable Gate Array.

General FPGA Architecture Field Programmable Gate Array.
Robust Low Power VLSI R obust L ow P ower VLSI Finding the Optimal Switch Box Topology for an FPGA Interconnect Seyi Ayorinde Pooja Paul Chaudhury.

Robust Low Power VLSI R obust L ow P ower VLSI Finding the Optimal Switch Box Topology for an FPGA Interconnect Seyi Ayorinde Pooja Paul Chaudhury.

Similar presentations

Ads by Google