Interconnect synthesis for reconfigurable multi-FPGA architectures

  • Vinoo Srinivasan
  • Shankar Radhakrishnan
  • Ranga Vemuri
  • Jeff Walrath
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1586)


Most reconfigurable multi-FPGA architectures have a programmable interconnection network that can be reconfigured to implement different interconnection patterns between the FPGAs and memory devices on the board. Partitioning tools for such architectures must produce the necessary pin-assignments and interconnect configuration stream that correctly implement the partitioned design. We call this process Interconnect Synthesis for reconfigurable architectures.

The primary contribution of this paper is a interconnection synthesis technique that is independent of the reconfigurable interconnection architecture. We have developed an automatic interconnect synthesis tool that is based on Boolean satisfiability. The target interconnection architecture is modeled in an architecture specification language. The desired interconnections among the FPGAs are specified as in the form of a netlist. The tool automatically generates the pin-assignments and the required values for the configuration-inputs in the architecture specification. We modeled several reconfigurable architectures and performed interconnect synthesis for varying number of desired nets. We provide experimental results that demonstrate the effectiveness of the interconnection synthesis technique.


Interconnection Network Binary Decision Diagram Boolean Equation Reconfigurable Architecture Interconnection Topology 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    “Wildforce”. “WILDFORCE Reference Manual, Document #11849-0000”. Annapolis Micro Systems, Inc.Google Scholar
  2. 2.
    “GigaOps”. Scholar
  3. 3.
    Pak K. Chan: “A Field-Programmable Prototyping Board: XC4000 User’s Guide”. Technical report. University of California, Santa Cruz, 1994.Google Scholar
  4. 4.
    R. E. Bryant. “Graph Based Algorithms for Boolean Function Manipulation”. In IEEE Trans. on Computers, C-35(8), pages 677–691, August 1986.Google Scholar
  5. 5.
    R. E. Bryant. “Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification”. In Proc. ACM/IEEE ICCAD, Nov. 1995.Google Scholar
  6. 6.
    S. Devadas. “Optimal layout via Boolean Satisfiability”. In Proc. ACM/IEEE ICCAD, pages 295–297, 1989.Google Scholar
  7. 7.
    R. G. Wood, R. Rutenbar. “FPGA Routing and Routability Estimation via Boolean Satisfiability”. In IEEE Trans. on VLSI, vol. 6 No. 2, pages 222–231, 1998.Google Scholar
  8. 8.
    Ranga Vemuri and Jeff Walrath. “Abstract models of reconfigurable computer architectures”. In SPIE 98, Nov 1998.Google Scholar
  9. 9.
    Jeff Walrath and Ranga Vemuri. “A Performance Modeling and Analysis Environment for Reconfigurable Computers”. In Proc. ACM/IEEE ICCAD, April 1998.Google Scholar
  10. 10.
    J. Walrath and R. Vemuri. “A Performance Modeling and Analysis Environment for Reconfigurable Computers”. In Proceedings of Parallel and Distributed Processing, pages 19–24. Springer, March 1998.Google Scholar
  11. 11.
    Scott Hauck and Gaetano Borriello. “Pin Assignment for Multi-FPGA Systems”. In Proc. of FPGAs for Custom Computing Machines, pages 11–13, April 1994.Google Scholar
  12. 12.
    Wai-Kei Mak and D.F. Wong. “On Optimal Board-Level Routing for FPGA based Logic Emulation”. In Proc. 32nd ACM/IEEE Design Automation Conference, pages 552–556, 1995.Google Scholar
  13. 13.
    C. Selvidge, A. Agarwal, M. Dahl, J. Babb. “TIERS: Topology Independent Pipelined Routing and Scheduling for Virtual Wire Compilation”. In Proc. Int. Symp. on FPGAs, pages 25–31, Feb. 1995.Google Scholar
  14. 14.
    Chunghee Kim and Hyunchul Shin. “A Performance-Driven Logic Emulation System: FPGA Network Design and Performance-Driven Partitioning”. In IEEE Trans. on CAD, vol. 15 No. 5, pages 560–568, May 1996.Google Scholar
  15. 15.
    Mohammad Khalid and Jonathan Rose. “A Hybrid Complete-Graph Partial-Crossbar Routing Architecture for Multi-FPGA Systems”. In Proc. Int. Symp. on FPGAs, pages 45–54, Feb. 1998.Google Scholar
  16. 16. Scholar
  17. 17.
    IQX160 Starter Kit User’s Guide”. I-Cube, Inc.Google Scholar
  18. 18.
    I. Ouaiss, et. al. “An Integrated Partitioning and Synthesis System for Dynamically Reconfigurable Multi-FPGA Architectures”. In Proceedings of Parallel and Distributed Processing, pages 31–36. Springer, March 1998.Google Scholar
  19. 19.
    S. Govindarajan, et. al. “An Effective Design Approach for Dynamically Reconfigurable Architectures”. In Int. Symposium on Field-Programmable Custom Computing Machines, pages 312–313, April 1998.Google Scholar

Copyright information

© Springer-Verlag 1999

Authors and Affiliations

  • Vinoo Srinivasan
    • 1
  • Shankar Radhakrishnan
    • 1
  • Ranga Vemuri
    • 1
  • Jeff Walrath
    • 1
  1. 1.DDEL, Department of ECECSUniversity of Cincinnati

Personalised recommendations