1 / 15

Topics

Topics. Multi-FPGA systems. Issues. Types of multi-FPGA systems. Multi-FPGA networks. Multi-FPGA partitioning. Types of systems. Can build a specialized multi-FPGA system. Wired for one purpose. Can build reusable multi-FPGA system. Emulators, other debugging systems. Networks. Ad hoc.

more
Download Presentation

Topics

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Topics • Multi-FPGA systems.

  2. Issues • Types of multi-FPGA systems. • Multi-FPGA networks. • Multi-FPGA partitioning.

  3. Types of systems • Can build a specialized multi-FPGA system. • Wired for one purpose. • Can build reusable multi-FPGA system. • Emulators, other debugging systems.

  4. Networks • Ad hoc. • Best suited for specialized systems. • Crossbar. • Fully connected. • Specialized crossbars. • Multi-stage. • Not often used in multi-FPGA systems.

  5. Crossbar • Fully connected: w x y z a b c d

  6. Properties of crossbar • Fully connected: • Single source/destination. • Multi-point. • n2 area.

  7. Clos network • System of crossbars that has less than n2 area. • Fully connected for single-destination connections. • Not fully connected for multiple destinations.

  8. Clos network organization

  9. Net size distribution • Most nets are small, making Clos network feasible for logic: # nets # pins 1 2 3

  10. Partial crossbar • Takes advantage of FPGA reprogrammability. • Several small crossbars. • If your crossbar doesn’t have room for the connection, reprogram to use another crossbar on another pin.

  11. Trees and fat trees • Trees allow communication between leaves. • Fat trees provide more bandwidth near root. …

  12. Multi-chip partitioning • Somewhat similar to partitioning for LE placement. • Differences: • k-way partitioning; • pins are a major cost; • must handle large problems.

  13. K-way partitioning • Direct: • Divide into k sets. • Iterative: • Extract one set, then another, etc.

  14. Clustering-based partitioning • Grow a cluster to form a partition. • Start with a seed for the cluster. • Choose new nodes to add to the cluster. • Next move depends on the quality of the previous moves.

  15. Fiduccia-Mattheyses partitioning • Can deal with variable-sized blocks. • Related to Kernighan-Lin partitioning. • Uses a new data structure to determine the best cell to move. • Uses an improved algorithm for updating cell gains after a move. • Total gain recomputation can be performed by a set of constant time gain increments/decrements.

More Related