Logic Partition Orderings for Multi-FPGA Systems

One of the critical issues for multi-FPGA systems is developing software tools for automatically mapping circuits. In this paper we consider one step in this process, partitioning. We describe the task of finding partition orderings, i.e., determining the way in which a circuit should be bipartitioned so as to best map it to a multi-FPGA system. This allows multi-FPGA partitioners to harness standard partitioning techniques. We develop an algorithm for finding partition orderings, which includes a method for increasing parallelism in the process, as well as for including multi-sectioning and multi-way partitioning algorithms. This method is very efficient, and capable of handling most of the current multi-FPGA topologies.

[1]  Anant Agarwal,et al.  Virtual wires: overcoming pin limitations in FPGA-based logic emulators , 1993, [1993] Proceedings IEEE Workshop on FPGAs for Custom Computing Machines.

[2]  Carl Ebeling,et al.  Springbok: A Rapid-Prototyping System for Board-Level Designs , 1994 .

[3]  Daniel P. Lopresti.  Rapid implementation of a genetic sequence comparator using field-programmable logic arrays , 1991 .

[4]  Chingwei Yeh,et al.  A probabilistic multicommodity-flow solution to circuit clustering problems , 1992, ICCAD.

[5]  Wolfgang Rosenstiel,et al.  A prototyping environment for hardware/software codesign in the COBRA project , 1994, Third International Workshop on Hardware/Software Codesign.

[6]  Laura A. Sanchis,et al.  Multiple-Way Network Partitioning , 1989, IEEE Trans. Computers.

[7]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[8]  Balakrishnan Krishnamurthy,et al.  An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.

[9]  Chung-Kuan Cheng,et al.  Towards efficient hierarchical designs by ratio cut partitioning , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[10]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[11]  Brian W. Kernighan,et al.  A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Konrad Doll,et al.  Partitioning Very Large Circuits Using Analytical Placement Techniques , 1994, 31st Design Automation Conference.

[13]  David E. Van den Bout,et al.  The anyboard rapid prototyping environment , 1991 .

[14]  Gershon Kedem,et al.  Standard Cell Placement by Quadrasection , 1986 .

[15]  Gaetano Borriello,et al.  An Evaluation of Bipartitionin g Techniques , 1995 .

[16]  James P. Cohoon,et al.  SHARP-looking geometric partitioning , 1991, Proceedings of the European Conference on Design Automation..

[17]  Martin D. F. Wong,et al.  Efficient network flow based min-cut balanced partitioning , 1994, ICCAD.

[18]  Martine D. F. Schlag,et al.  BORG: A RECONFIGURABLE PROTOTYPING BOARD USING FIELD-PROGRAMMABLE GATE ARRAYS , 1991 .

[19]  A. J. Stone,et al.  Logic partitioning , 1966, DAC.

[20]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[21]  Carl Sechen,et al.  A timing driven N-way chip and multi-chip partitioner , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[22]  G. Vijayan.  Partitioning logic on graph structures to minimize routing cost , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[23]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[24]  Aaron T. Ferrucci,et al.  ACME: A Field-Programmable Gate Array Implementation of a Self-Adapting and Scalable Connectionist N , 1994 .

[25]  Byung Ro Moon,et al.  A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs , 1994, 31st Design Automation Conference.

[26]  Jean Vuillemin,et al.  Programmable Active Memories: A Performance Assessment , 1992, Heinz Nixdorf Symposium.

[27]  Joseph Varghese,et al.  An efficient logic emulation system , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[28]  Martine D. F. Schlag,et al.  Spectral K-Way Ratio-Cut Partitioning and Clustering , 1993, 30th ACM/IEEE Design Automation Conference.

[29]  David M. Lewis,et al.  A field programmable accelerator for compiled-code applications , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

[30]  Gaetano Borriello,et al.  An evaluation of bipartitioning techniques , 1995, Proceedings Sixteenth Conference on Advanced Research in VLSI.

[31]  A. Smith,et al.  PRISM-II compiler and architecture , 1993, [1993] Proceedings IEEE Workshop on FPGAs for Custom Computing Machines.