JPH03211859A - Device for deciding layout position - Google Patents

Device for deciding layout position

Info

Publication number
JPH03211859A
JPH03211859A JP2006435A JP643590A JPH03211859A JP H03211859 A JPH03211859 A JP H03211859A JP 2006435 A JP2006435 A JP 2006435A JP 643590 A JP643590 A JP 643590A JP H03211859 A JPH03211859 A JP H03211859A
Authority
JP
Japan
Prior art keywords
logical connection
network
minimum cost
flow
divided
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
JP2006435A
Other languages
Japanese (ja)
Inventor
Takeshi Yoshimura
猛 吉村
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NEC Corp
Original Assignee
NEC Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NEC Corp filed Critical NEC Corp
Priority to JP2006435A priority Critical patent/JPH03211859A/en
Publication of JPH03211859A publication Critical patent/JPH03211859A/en
Pending legal-status Critical Current

Links

Landscapes

  • Semiconductor Integrated Circuits (AREA)
  • Design And Manufacture Of Integrated Circuits (AREA)

Abstract

PURPOSE:To obtain a layout position deciding device which can make excellent aggregation and division by optimizing a flow on a network which represents the logic connecting information between arranged elements. CONSTITUTION:When a logic connecting network storing section 1 stores a logic connecting network which represents logic connecting information, a minimum cost flow calculating section 2 sets the capacity of a virtual arc to be connected to a source on the logic connecting network to '1' and calculates the minimum cost flow on the network. An aggregating and dividing section 3 discriminates whether or not an element aggregate can be divided into two parts by an arc aggregate, the flow quantity of which is not zero, and terminates the calculation when the element aggregate can be divided into two parts. When the aggregate cannot be divided, the section 3 adds '1' to the capacity of the virtual arc. Therefore, the element aggregate can be divided into tow parts on the basis of the (optimum) minimum cost flow and the quality of the solution can be improved.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は配置位置決定装置、特にLSIの配置位置決定
装置に関するものである。
DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a placement position determining device, and particularly to a placement position determining device for an LSI.

〔従来の技術〕[Conventional technology]

従来、LSIの配置を決定する打力手法の一つであるミ
ニカット法では、次の条件のもとて全素子集合を二つの
集合に分割する処理を扱っている。
Conventionally, the mini-cut method, which is one of the impact methods for determining the placement of LSI, deals with the process of dividing the entire element set into two sets under the following conditions.

■それぞれの集合の素子数の差は、あらかしめ指定され
た許容値以下とする。
■The difference in the number of elements in each set shall be less than or equal to the preliminarily specified tolerance value.

■集合をまたがる配線本数を最小とする。■Minimize the number of wires spanning the set.

従来の手法では、まず大まかに二つの集合に分割した後
、局所的な変換により初期解の改良を行っていた。
In the conventional method, the initial solution is first roughly divided into two sets, and then the initial solution is improved by local transformation.

このような従来の手法は、予稿集「枝広、吉村:階層ク
ラスタリングを用いたスタンダードセルのための配線ア
ルゴリズムJ 19B9年電子情報通信学会秋期全国大
会、 A−94に詳しく述べられている。
Such conventional methods are described in detail in the proceedings of ``Edahiro, Yoshimura: Routing Algorithm for Standard Cells Using Hierarchical Clustering J'' 19B9 IEICE Autumn National Conference, A-94.

〔発明が解決しようとする課題〕[Problem to be solved by the invention]

前記のように、初期解を改良する方式では、解の良さは
初期分割の善し悪しに大きく依存し、良い解が得られな
い場合があった。
As described above, in the method of improving the initial solution, the quality of the solution largely depends on the quality of the initial division, and there are cases where a good solution cannot be obtained.

本発明の目的は、配置素子間の論理接続情報を表現する
ネットワーク上でフローを最適化することにより、良好
な集合分割を行う配置位置決定装置を提供することにあ
る。
An object of the present invention is to provide a placement position determination device that performs good set division by optimizing flows on a network expressing logical connection information between placed elements.

〔課題を解決するための手段〕[Means to solve the problem]

本発明の配置位置決定装置は、 入力として与えられる配置素子間の論理接続情報を表す
論理接続ネットワークを格納する論理接続ネットワーク
格納部と、 前記ネットワーク上で最小コストフローを計算する最小
コストフロー計算部と、 前記ネットワーク上のフローの状態に基づき素子集合を
二つの集合に分割する集合分割部とからなることを特徴
とする。
The placement position determination device of the present invention includes: a logical connection network storage unit that stores a logical connection network representing logical connection information between placement elements given as input; and a minimum cost flow calculation unit that calculates a minimum cost flow on the network. and a set dividing unit that divides the element set into two sets based on the state of the flow on the network.

[作用] 本発明による素子集合分割を第3図〜第5図に基づいて
説明する。なお、第3図は論理接続および素子集合分割
の説明図、第4図は論理接続ネット、ワークの説明図、
第5図は論理接続ネットワークの各アークのフロー量と
コストの関係を表す説明図である。
[Operation] Element set division according to the present invention will be explained based on FIGS. 3 to 5. In addition, FIG. 3 is an explanatory diagram of logical connection and element set division, and FIG. 4 is an explanatory diagram of logical connection network and work.
FIG. 5 is an explanatory diagram showing the relationship between the flow amount and cost of each arc in the logical connection network.

格納部に、例えば第3図(a)に示すような配置素子間
の論理接続情報、すなわち全素子集合の論理接続情報が
与えられると、論理接続情報を表す論理接続ネットワー
クを格納する。第3図(a)において、口は外部入出力
端子21の論理接続情報を、Oは配置素子22の論理接
続情報を、−は素子間の配線23の論理接続情報を表し
ている。第4図は格納された論理接続ネットワークであ
り、■はフローのソース31を、■はフローのシンク3
2を、口は仮想ノード34を、−は仮想アーク33.3
5a、 35b。
When the storage unit is given logical connection information between arranged elements as shown in FIG. 3(a), that is, logical connection information of all element sets, it stores a logical connection network representing the logical connection information. In FIG. 3(a), the opening represents logical connection information of the external input/output terminal 21, O represents the logical connection information of the arranged element 22, and - represents the logical connection information of the wiring 23 between the elements. Figure 4 shows the stored logical connection network, where ■ indicates the source 31 of the flow, and ■ indicates the sink 3 of the flow.
2, mouth is virtual node 34, - is virtual arc 33.3
5a, 35b.

35c、36a、36b、36cを、○は配置すべき素
子または外部入出力端子に対応するノード37を、は配
線に対応するアーク38を表している。
35c, 36a, 36b, and 36c, ◯ indicates a node 37 corresponding to an element to be placed or an external input/output terminal, and ◯ indicates an arc 38 corresponding to a wiring.

最小コストフロー計算部は、論理接続ネットワークにお
いて、仮想アーク35a、35b、35c、36a、3
6b、36cの容量を無限大とし、ソース31につなが
る仮想アーク33の容量を1から順次増やしながら、ソ
ース31からシンク32への最小コストフローを、第5
図に示すアークのフロー量とコストの関係に基づいて計
算する。
The minimum cost flow calculation unit calculates virtual arcs 35a, 35b, 35c, 36a, 3 in the logical connection network.
The minimum cost flow from the source 31 to the sink 32 is set as
Calculated based on the relationship between arc flow amount and cost shown in the figure.

素子集合は、最小コストフロー計算部において求まった
フロー量が非零となるアークの集合を用いて、第3図(
b)に示すごとく素子集合を二つに分割する。第3図(
b)では、カットライン25で分割された素子集合24
a、24bを示している。
The element set is determined by using the set of arcs for which the flow amount determined by the minimum cost flow calculation unit is non-zero, as shown in Fig. 3 (
Divide the element set into two as shown in b). Figure 3 (
In b), the element set 24 divided by the cut line 25
a, 24b are shown.

〔実施例] 次に、本発明の詳細な説明する。第1図は本発明の配置
位置決定装置の一実施例を示すブロック図である。
[Example] Next, the present invention will be explained in detail. FIG. 1 is a block diagram showing an embodiment of the placement position determination device of the present invention.

論理接続ネットワーク格納部1は、論理接続情報を表す
論理接続ネットワークを格納する。
The logical connection network storage unit 1 stores logical connection networks representing logical connection information.

最小コストフロー計算部2は、論理接続ネットワーク上
で最小コストフローを計算する。
The minimum cost flow calculation unit 2 calculates the minimum cost flow on the logical connection network.

集合分割部3は、論理接続ネットワーク上の最小コスト
フローに基づいて素子集合を二つに分割する。
The set dividing unit 3 divides the element set into two based on the minimum cost flow on the logical connection network.

続いて、本実施例の動作を第2図の流れ図を参照して説
明する。
Next, the operation of this embodiment will be explained with reference to the flowchart of FIG.

論理接続ネットワーク格納部1が、論理接続情報を表す
論理接続ネットワークを格納すると(ステップS1)、
最小コストフロー計算部2は論理接続ネットワーク上で
ソースにつながる仮想アークの容量を1としくステップ
S2)、論理接続ネットワーク上で最小コストフローを
計算する(ステップS3)。
When the logical connection network storage unit 1 stores a logical connection network representing logical connection information (step S1),
The minimum cost flow calculation unit 2 sets the capacity of the virtual arc connected to the source on the logical connection network to 1 (step S2), and calculates the minimum cost flow on the logical connection network (step S3).

集合分割部3では、フロー量が非零のアークの集合によ
り素子集合が二つに分割できるか否かを判断しくステッ
プS4)、分割できれば終了し、分割できなければ、ス
テップS2で設定した仮想アークの容量に1を加えステ
ップS3にもどる(ステップS5)。
The set dividing unit 3 judges whether the element set can be divided into two by a set of arcs with non-zero flow amount (step S4), and if the division is possible, the process ends; if the division is not possible, the virtual set in step S2 is used. Add 1 to the arc capacity and return to step S3 (step S5).

〔発明の効果〕〔Effect of the invention〕

以上述べた通り本発明によれば、(最適な)最小コスト
フローに基づいて素子集合を分割するため、従来手法に
比べ解の質の向上がはかれる。
As described above, according to the present invention, the element set is divided based on the (optimal) minimum cost flow, so that the quality of the solution can be improved compared to the conventional method.

【図面の簡単な説明】[Brief explanation of drawings]

第1図は本発明の配置位置計算装置の一実施例を示すブ
ロック図、 第2図は第1図の実施例の動作を説明するための流れ図
、 第3図は論理接続および素子集合分割の説明図、第4図
は論理接続ネットワークの説明図、第5図は論理接続ネ
ットワークの各アークのフロー量とコストの関係を表す
説明図である。 1・・・・・論理接続ネットワーク格納部2・・・・・
最小コストフロー計算部 3・・・・・集合分割部 21・・・・・外部入出力端子 22・・・・・配置素子 23・・・・・配線 24a、24b・・・分割された素子集合25・・・・
・カットライン 31・・・・・ソース 32・・・・・シンク 33、35.36・ ・ ・仮想アーク37・・・・・
ノード 38・ ・ ・ ・ ・アーク
Fig. 1 is a block diagram showing an embodiment of the arrangement position calculation device of the present invention, Fig. 2 is a flowchart for explaining the operation of the embodiment of Fig. 1, and Fig. 3 is a diagram showing logical connections and element set division. FIG. 4 is an explanatory diagram of the logical connection network, and FIG. 5 is an explanatory diagram showing the relationship between the flow amount and cost of each arc of the logical connection network. 1...Logical connection network storage unit 2...
Minimum cost flow calculation unit 3...set division unit 21...external input/output terminal 22...placed elements 23...wiring 24a, 24b...divided element set 25...
・Cut line 31... Source 32... Sink 33, 35.36... ・Virtual arc 37...
Node 38・・・・・・Arc

Claims (1)

【特許請求の範囲】[Claims] (1)入力として与えられる配置素子間の論理接続情報
を表す論理接続ネットワークを格納する論理接続ネット
ワーク格納部と、 前記ネットワーク上で最小コストフローを計算する最小
コストフロー計算部と、 前記ネットワーク上のフローの状態に基づき素子集合を
二つの集合に分割する集合分割部とからなることを特徴
とする配置位置決定装置。
(1) a logical connection network storage unit that stores a logical connection network representing logical connection information between arranged elements given as input; a minimum cost flow calculation unit that calculates a minimum cost flow on the network; 1. A placement position determination device comprising: a set dividing section that divides an element set into two sets based on a flow state.
JP2006435A 1990-01-17 1990-01-17 Device for deciding layout position Pending JPH03211859A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2006435A JPH03211859A (en) 1990-01-17 1990-01-17 Device for deciding layout position

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2006435A JPH03211859A (en) 1990-01-17 1990-01-17 Device for deciding layout position

Publications (1)

Publication Number Publication Date
JPH03211859A true JPH03211859A (en) 1991-09-17

Family

ID=11638319

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2006435A Pending JPH03211859A (en) 1990-01-17 1990-01-17 Device for deciding layout position

Country Status (1)

Country Link
JP (1) JPH03211859A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05128205A (en) * 1991-10-30 1993-05-25 Kawasaki Steel Corp Placement and wiring deciding method

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05128205A (en) * 1991-10-30 1993-05-25 Kawasaki Steel Corp Placement and wiring deciding method

Similar Documents

Publication Publication Date Title
EP1264451B1 (en) Method and system for controlling data traffic in a network
US4893303A (en) Method and apparatus for parallel computation
US5734917A (en) System for producing combination circuit to satisfy prescribed delay time by deleting selected path gate and allowing to perform the permissible function for initial circuit
JPH0241053A (en) Route selection method in data communication network
JP2002199005A (en) Method for designing interconnect fabric
CN108664751B (en) A multi-simulator collaborative simulation method, simulation main control platform and simulation system
Masson Binomial switching networks for concentration and distribution
US20120198093A1 (en) Interconnection Fabric Connection
EP0984655B1 (en) Method for generating the optimal PNNI complex node representations for restrictive costs
Afek et al. Convergence complexity of optimistic rate based flow control algorithms
JPH03211859A (en) Device for deciding layout position
Girard et al. Dimensioning of adaptively routed networks
Wang et al. Performance-driven interconnect global routing
JP2605605B2 (en) Path bandwidth setting control method
JP2929978B2 (en) Automatic wiring method and device
JPH0345598B2 (en)
JPH11163890A (en) Pnni path calculation system in atm exchange with a plurality of information taken into account
JPH11205331A (en) Network control device
JP2982866B2 (en) Bandwidth allocation method for packet communication network
JP4009277B2 (en) Method, program product, and design tool for automatic transmission line selection in application specific integrated circuits
Qi et al. The structural property of network bottlenecks in maxmin fair flow control
Aida et al. Optimal routing in communication networks with delay variations
WO2024174588A1 (en) Forward path determination method and apparatus, electronic device and storage medium
JP2611659B2 (en) Calculation method of transmission capacity and traffic flow
CN121585604A (en) Data routing methods, devices, electronic equipment, storage media and software products