Performance-oriented circuit partitioning algorithm with logic-block replication for multi-FPGA systems

Nozomu Togawa*, Masao Sato, Tatsuo Ohtsuki

*この研究の対応する著者

研究成果: Paper査読

2 被引用数 (Scopus)

抄録

This paper proposes a circuit partitioning algorithm in which the delay of each critical signal path is within a specified upper bound. Its core is recursive bipartitioning of a circuit which consists of three stages: 0) detection of critical paths; 1) bipartitioning of a set of primary inputs and outputs; and 2) bipartitioning of a set of logic-blocks. In 0), the algorithm detects the critical paths based on their lower bounds of delays. The delays of the critical paths are reduced with higher priority. In 1), the algorithm attempts to assign the primary input and output on each critical path to one chip. In 2), the algorithm not only decreases the number of crossings between chips but also assigns the logic-blocks on each critical path to one chip by exploiting a network flow technique with logic-block replication. The experimental results demonstrate that it resolves almost all path delay constraints with maintaining the maximum number of required I/O blocks per chip small compared with conventional algorithms.

本文言語English
ページ294-297
ページ数4
出版ステータスPublished - 1996 12 1
イベントProceedings of the 1996 IEEE Asia Pacific Conference on Circuits and Systems - Seoul, South Korea
継続期間: 1996 11 181996 11 21

Other

OtherProceedings of the 1996 IEEE Asia Pacific Conference on Circuits and Systems
CitySeoul, South Korea
Period96/11/1896/11/21

ASJC Scopus subject areas

  • 電子工学および電気工学

フィンガープリント

「Performance-oriented circuit partitioning algorithm with logic-block replication for multi-FPGA systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル