JPH05143691A - Automatic wiring system - Google Patents

Automatic wiring system

Info

Publication number
JPH05143691A
JPH05143691A JP3328213A JP32821391A JPH05143691A JP H05143691 A JPH05143691 A JP H05143691A JP 3328213 A JP3328213 A JP 3328213A JP 32821391 A JP32821391 A JP 32821391A JP H05143691 A JPH05143691 A JP H05143691A
Authority
JP
Japan
Prior art keywords
wiring
area
rough
computer
obstacles
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.)
Granted
Application number
JP3328213A
Other languages
Japanese (ja)
Other versions
JP3006244B2 (en
Inventor
So Yamauchi
宗 山内
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 JP3328213A priority Critical patent/JP3006244B2/en
Publication of JPH05143691A publication Critical patent/JPH05143691A/en
Application granted granted Critical
Publication of JP3006244B2 publication Critical patent/JP3006244B2/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Landscapes

  • Design And Manufacture Of Integrated Circuits (AREA)

Abstract

PURPOSE:To accelerate wiring processing by performing the detail wiring of plural pins and nets whose rough wiring routes are set independently with each other in parallel by plural computers when the automatic wiring processing of an integrated circuit and a printed board is performed. CONSTITUTION:When the automatic wiring processing is performed on the integrated circuit and the printed board, each computer takes the partial charge of the processing by dividing a wiring area classified by every layer into belt shape wiring areas along the wiring direction of the layer, then, the plural computers take the partial charge of the same belt shape wiring areas, and a pair of pins are allocated to a computer group to which no pair of pins in which the rough wiring routes 31-34 representing through which area of the wiring the wiring route of the pair of pins to be wired should pass are not intersected are allocated in the computer over which the rough wiring routes are spreading, and each computer group performs parallel processing by performing the detail wiring of the allocated pair of pins respectively in parallel in the rough wiring routes 31-34.

Description

【発明の詳細な説明】Detailed Description of the Invention

【0001】[0001]

【産業上の利用分野】本発明は集積回路やプリント基板
における配線処理を複数の計算機の並列処理により行な
う、自動配線方式に関する。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an automatic wiring system for performing wiring processing on an integrated circuit or a printed circuit board by parallel processing of a plurality of computers.

【0002】[0002]

【従来の技術】従来の自動配線方式としては、配線領域
を格子として扱い、全ての格子を記憶領域に確保し、配
線すべき端子に相当する格子から波面伝搬に基づいて各
格子にラベル付けをし、その波面が目標とする端子にた
どりついたら、ラベルを逆にたどって経路を完成させる
「迷路法」があり、配線領域を並列計算機を構成する各
プロセッサに分担させて波面伝搬を並列に行なう方式が
よく知られている。
2. Description of the Related Art In the conventional automatic wiring system, the wiring area is treated as a grid, all the grids are secured in a storage area, and each grid is labeled from the grid corresponding to the terminal to be wired based on wavefront propagation. Then, when the wavefront reaches the target terminal, there is a "maze method" that reverses the label and completes the path, and the wiring area is shared by each processor constituting the parallel computer and the wavefront propagation is performed in parallel. The method is well known.

【0003】この従来技術については、1986年情報
処理学会論文誌「並列ルーティングプロセッサの試作研
究」に詳述されている。
This conventional technique is described in detail in 1986, "Information Processing Society of Japan", "Prototype Research of Parallel Routing Processor".

【0004】また、概略配線経路間の並列性を用いた自
動配線方式としては、各計算機は配線領域を分割して担
当し、各計算機は、自分の担当する配線領域に含まれる
障害物及び、障害物自体は隣の領域に存在するがデザイ
ン・ルールによってその障害物が与える影響が自分の領
域に及ぶところの障害物の属性、位置を記憶し、それら
の障害物の角からデザイン・ルールを満たす距離だけ離
れた位置にコーナー・ポイントを生成し、そのコーナー
・ポイントを基準としてその障害物を回避するエスケー
プ・ラインを生成し、おおまかな配線経路を示す概略配
線経路は予め求めておき、次に、あるネットの概略配線
経路を含む領域を担当している計算機グループは、その
概略配線領域内のエスケープ・ラインの中から、端子間
を接続するための経路を探索し、計算機グループを構成
する計算機が互いに重複しない計算機グループは複数グ
ループが同時に詳細配線を行なう「並列線分探索法」と
いうものもある(特願平3−128497)。
Further, as an automatic wiring method using parallelism between rough wiring paths, each computer divides a wiring area and takes charge of each wiring area. Each computer takes charge of obstacles included in its own wiring area and Obstacles themselves exist in the adjacent area, but remember the attributes and positions of the obstacles where the influence of the obstacles on your area due to the design rules, remember the design rules from the corners of those obstacles. Generate a corner point at a distance that satisfies the condition, generate an escape line that avoids the obstacle based on that corner point, and obtain a rough wiring route that shows a rough wiring route in advance. In addition, the computer group that is in charge of the area including the rough wiring route of a certain net is designed to connect terminals from among the escape lines in the rough wiring area. Exploring the road, the computer group that computer do not overlap with each other for constituting the computer group while others that multiple groups simultaneously perform a detailed wiring "parallel line search method" (Japanese Patent Application No. 3-128497).

【0005】[0005]

【発明が解決しようとする課題】「迷路法」を並列化し
た方式では、一組のピンペアの配線処理を並列化して高
速化することを目的としている。しかし、一組のピンペ
アの配線処理に内在する並列度はそれほど高くないの
で、並列処理による高速化の効果はそれほど得られな
い。
In the method in which the "maze method" is parallelized, the object is to parallelize the wiring process for one set of pin pairs to speed up the process. However, since the degree of parallelism inherent in the wiring processing of one pair of pins is not so high, the effect of speeding up by parallel processing cannot be obtained so much.

【0006】概略配線経路間の並列性を用いた「並列線
分探索法」では、帯状の配線領域毎に計算機を1台ずつ
割り当てているので、詳細配線の対象となるネットの概
略配線がまたがる帯状の配線領域が独立なものでなけれ
ば、例え概略配線経路自身が独立であっても同時に配線
処理を進めることが不可能であった。
In the "parallel line segment search method" using parallelism between rough wiring routes, one computer is allocated to each strip-shaped wiring area, so that the rough wiring of the net to be the detailed wiring spans. If the strip-shaped wiring regions are not independent, it is impossible to proceed with the wiring processing at the same time even if the schematic wiring paths themselves are independent.

【0007】[0007]

【課題を解決するための手段】本発明に係る自動配線方
式は、集積回路やプリント基板の多層配線領域における
配線処理を接続網で接続された複数の計算機により並列
処理する自動配線方式であって、配線領域を層別にその
層の配線方向に沿った帯状の配線領域に分割して各計算
機に分担させ、その際に同一の帯状の配線領域を複数の
計算機に分担させ、各計算機は、自分の担当する帯状の
配線領域に含まれる障害物及び、障害物自体は隣の領域
に存在するがデザイン・ルールによってその障害物が与
える影響が自分の領域に及ぶところの障害物の属性及び
位置を記憶し、それらの障害物の角からデザイン・ルー
ルを満たす距離だけ離れた位置にコーナー・ポイントを
生成し、そのコーナー・ポイントを基準としてその障害
物を回避するエスケープ・ラインを生成し、おおまかな
配線経路を示す概略配線経路は予め求めておき、次に、
あるネットの概略配線を含む領域を担当している計算機
グループは、その概略配線経路内のエスケープ・ライン
の中から、端子間を接続するための経路を探索し、計算
機グループを構成する計算機が互いに重複しない計算機
グループは複数グループが同時に詳細配線を行なうこと
を特徴とする。
An automatic wiring system according to the present invention is an automatic wiring system in which wiring processing in a multilayer wiring area of an integrated circuit or a printed circuit board is processed in parallel by a plurality of computers connected by a connection network. , The wiring area is divided into layers into strip-shaped wiring areas along the wiring direction of each layer, and the respective computers share the same. At that time, the same strip-shaped wiring area is shared by a plurality of computers. Obstacles included in the strip-shaped wiring area in charge of and the obstacle itself exist in the adjacent area, but the attribute and position of the obstacle where the influence of the obstacle affects your own area by the design rule are set. The memorize and generate a corner point at a distance from the corners of the obstacles that satisfies the design rule, and avoid the obstacles based on the corner points. Generate-loop line, rough wiring path showing the rough wiring path is previously obtained in advance, then,
The computer group that is in charge of the area including the rough wiring of a net searches the escape line in the rough wiring route for a route for connecting terminals, and the computers that make up the computer group mutually The non-overlapping computer groups are characterized in that a plurality of groups perform detailed wiring simultaneously.

【0008】[0008]

【作用】本発明では、集積回路やプリント基板の自動配
線処理の際に、配線するピンペアの配線経路が配線領域
内のどのあたりを通るべきかを示す概略配線経路を決
め、次に、概略配線経路が互いに独立したピンペアを、
各計算機の担当する配線領域に従ってそれぞれ別の計算
機グループに割り当てる。この際に同一の帯状の配線領
域を担当する計算機が複数台あるので、同一の帯状の配
線領域に存在するが、概略配線は独立であるいくつかの
ピンペアを同時に配線処理することが可能である。そし
て、各計算機グループはそれぞれ割り当てられたピンペ
アの詳細配線をその概略配線経路内で並列に行なうこと
により、高い並列性が得られ、配線処理が高速化する。
According to the present invention, in the automatic wiring process of an integrated circuit or a printed circuit board, a rough wiring route indicating which part of the wiring region the wiring route of the pin pair to be wired should pass is determined, and then the rough wiring is performed. Pin pairs whose paths are independent of each other,
Assign to different computer groups according to the wiring area that each computer is in charge of. At this time, since there are a plurality of computers in charge of the same strip-shaped wiring area, they exist in the same strip-shaped wiring area, but the general wiring can process several pin pairs that are independent of each other at the same time. .. Then, each computer group performs the detailed wiring of the pin pairs assigned thereto in parallel within the rough wiring route, whereby high parallelism is obtained and the wiring processing is speeded up.

【0009】また、配線領域内に存在する障害物、端
子、既配線等のデータを全プロセッサを用いて分散配置
できるため、大規模な配線対象の自動配線が可能であ
る。
Further, since data of obstacles, terminals, existing wirings, etc. existing in the wiring area can be distributed and arranged by using all processors, a large-scale automatic wiring can be performed.

【0010】[0010]

【実施例】本発明の自動配線方式について、実施例を挙
げ、詳しく説明する。ここで示す実施例では、計算機の
数が64台である。
EXAMPLES The automatic wiring system of the present invention will be described in detail with reference to examples. In the embodiment shown here, the number of computers is 64.

【0011】図1は、その実施例における複数の計算機
による配線領域の分担状況を示すもので、配線領域は、
2層であり、第1層はX軸方向の配線、第2層はY軸方
向の配線を行なうための層である。並列処理を行なう計
算機(PE)を64台とし、それぞれをPE0、PE1
…PE63とする。この例では、同一の帯状の配線領域
を分担する計算機の台数を2台ずつとし、図??で示す
様に、例えばPE0とPE16、PE1とPE17とい
った計算機が同一の帯状の配線領域を担当している。
FIG. 1 shows the distribution of the wiring area by a plurality of computers in the embodiment.
The second layer is a layer for wiring in the X-axis direction, and the second layer is a layer for wiring in the Y-axis direction. There are 64 computers (PE) that perform parallel processing, PE0 and PE1 respectively.
... PE63. In this example, the number of computers that share the same strip-shaped wiring area is two, and the figure? ? As shown by, the computers such as PE0 and PE16 and PE1 and PE17 are in charge of the same strip-shaped wiring area.

【0012】図2では、その実施例における前処理の様
子を示す。各計算機は、障害物21に関する情報に基づ
き、その障害物21の角からデザイン・ルールの許容範
囲だけ離れた位置にコーナー・ポイント22を生成す
る。そして、各計算機は、生成したコーナー・ポイント
22が障害物からデザイン・ルールの許容範囲以上離れ
た位置にあるかどうかを調べ、それを守っていないコー
ナー・ポイント22は取り除く。次に、各計算機は、コ
ーナー・ポイント22からエスケープ・ライン23を生
成する。これは、コーナー・ポイント22からその層の
配線方向に沿って線を伸ばした時に最初にぶつかる障害
物からデザイン・ルールの許容範囲だけ離れた位置まで
伸ばして生成する。
FIG. 2 shows a state of pretreatment in the embodiment. Each computer generates a corner point 22 at a position distant from the corner of the obstacle 21 by the allowable range of the design rule based on the information on the obstacle 21. Then, each computer checks whether or not the generated corner point 22 is apart from the obstacle by a distance larger than the allowable range of the design rule, and removes the corner point 22 that does not comply with it. Next, each computer generates an escape line 23 from the corner point 22. This is generated by extending a distance from the corner point 22 along the wiring direction of the layer by a design rule allowable range from an obstacle that first hits.

【0013】これらの、コーナー・ポイント22の生
成、エスケープ・ライン23の生成の処理は、各計算機
が自分の担当する領域に関する情報のみを用いて行なう
ことが出来るので、計算機間の通信が全く不要であり、
全ての計算機の処理が終ったところで全ての計算機間の
同期をとる。
Since the processing of generating the corner points 22 and the generation of the escape line 23 can be performed by each computer using only the information regarding the area in which it is in charge, communication between computers is not required at all. And
When the processing of all the computers is completed, all the computers are synchronized.

【0014】図3は、その実施例において概略配線経路
内の配線を担当する計算機グループを分割した様子を示
す。この場合、概略配線経路31と概略配線経路33
は、同一のY軸方向の帯状の配線領域にまたがっている
が、概略配線経路自身は重なりあっていないので、概略
配線経路31内の詳細配線を行なう計算機グループと、
概略配線経路33内の詳細配線を行なう計算機グループ
を分けることにより、両方の詳細配線を同時に行なうこ
とが可能となる。この例では、重複した帯状の配線領域
を担当する計算機の台数が2台ずつなので、この様な重
複は2まで許される。図3の場合、概略経路31はPE
0,PE1,PE2,PE3,PE33,PE34,P
E35,PE36が詳細配線を担当、概略経路33はP
E9,PE10,PE11,PE12,PE49,PE
50,PE51,PE52,PE53が詳細配線を担
当、概略経路32はPE4,PE5,PE6,PE7,
PE42,PE43,PE44,PE45,PE46が
詳細配線を担当、概略配線34はPE24,PE25,
PE26,PE27,PE28,PE29,PE58,
PE59,PE60,PE61が詳細配線を担当する。
FIG. 3 shows a state in which a computer group in charge of wiring in the general wiring path is divided in this embodiment. In this case, the rough wiring route 31 and the rough wiring route 33
Spans the same strip-shaped wiring region in the Y-axis direction, but since the rough wiring routes themselves do not overlap, a computer group that performs detailed wiring in the rough wiring route 31,
By dividing the computer groups for performing the detailed wiring in the rough wiring route 33, it is possible to perform both the detailed wirings at the same time. In this example, since the number of computers in charge of the overlapping strip-shaped wiring area is two, two such overlappings are allowed. In the case of FIG. 3, the general route 31 is PE.
0, PE1, PE2, PE3, PE33, PE34, P
E35 and PE36 are in charge of detailed wiring, and the general route 33 is P
E9, PE10, PE11, PE12, PE49, PE
50, PE51, PE52, PE53 are in charge of detailed wiring, and the rough path 32 is PE4, PE5, PE6, PE7,
PE42, PE43, PE44, PE45, PE46 are in charge of detailed wiring, and the general wiring 34 is PE24, PE25,
PE26, PE27, PE28, PE29, PE58,
PE59, PE60, PE61 take charge of detailed wiring.

【0015】図4は、その実施例における各計算機グル
ープ内の詳細配線について示している。予め生成されて
いるエスケープ・ライン23を概略配線領域の外形に合
わせてトリミングしてエスケープ・ライン44とする。
次に、端子S41と端子D42から探索線43を生成す
る。端子の存在する層、及びその隣(上、下)の層の同
一座標の点から、その層の配線方向に沿って障害物から
デザイン・ルールの許容範囲だけ離れた点まで線を伸ば
して探索線43とする。これらの処理はその配線領域を
担当するPEによって行なわれる。そして、端子S41
から生成された探索線43と交差するエスケープ・ライ
ン44を探し、さらにそのエスケープ・ライン44と交
差するエスケープ・ライン44を探すという処理を端子
D42から生成された探索線と交差するまで繰り返す。
そして端子D42のがわから逆向きにエスケープ・ライ
ンを辿ることによって配線経路を確定する。
FIG. 4 shows the detailed wiring within each computer group in this embodiment. The escape line 23 generated in advance is trimmed to the escape line 44 in accordance with the outline of the general wiring area.
Next, the search line 43 is generated from the terminals S41 and D42. Search by extending a line from the point with the same coordinates on the layer where the terminal exists and the layer next to it (upper and lower) to the point separated from the obstacle by the allowable range of the design rule along the wiring direction of the layer. It is line 43. These processes are performed by the PE in charge of the wiring area. Then, the terminal S41
The process of searching for the escape line 44 that intersects the search line 43 generated from, and further searching for the escape line 44 that intersects the escape line 44 is repeated until it crosses the search line generated from the terminal D42.
Then, by tracing the escape line in the opposite direction from the direction of the terminal D42, the wiring route is determined.

【0016】そして、複数の計算機グループの配線処理
が全て終ったら、次の配線ステップに進むということを
繰り返す。
Then, when the wiring processing of the plurality of computer groups is completed, the process proceeds to the next wiring step.

【0017】[0017]

【発明の効果】本発明では、集積回路やプリント基板の
自動配線処理の際に、配線するピンペアの配線経路が配
線領域内のどのあたりを通るべきかを示す概略配線経路
を決め、次に、概略配線経路が互いに独立したピンペア
をそれぞれ別の計算機グループに割り当て、各計算機グ
ループはそれぞれ割り当てられたピンペアの詳細配線を
その概略配線経路内で並列処理を行なうことにより、高
い並列性が得られ、配線処理が高速化するという効果が
ある。
According to the present invention, in the automatic wiring processing of an integrated circuit or a printed circuit board, a general wiring route indicating which part of the wiring region the wiring route of a pin pair to be wired should pass is determined, and then, High parallelism is obtained by assigning pin pairs whose rough wiring routes are independent of each other to different computer groups, and performing parallel processing on the detailed wiring of the pin pairs respectively assigned to the respective computer groups within the rough wiring route. This has the effect of speeding up the wiring process.

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

【図1】複数の計算機による配線領域の分担状況を示し
た図である。
FIG. 1 is a diagram showing a sharing state of a wiring area by a plurality of computers.

【図2】複数の計算機による前処理の様子を示した図で
ある。
FIG. 2 is a diagram showing a state of preprocessing by a plurality of computers.

【図3】概略配線内の配線を担当する計算機グループを
分割した様子を示した図である。
FIG. 3 is a diagram showing a state in which a computer group in charge of wiring within a schematic wiring is divided.

【図4】各計算機グループ内の詳細配線について示した
図である。
FIG. 4 is a diagram showing detailed wiring in each computer group.

【符号の説明】[Explanation of symbols]

21 障害物 22 コーナー・ポイント 23 エスケープ・ライン 31,32,33,34 概略配線経路 41 端子S 42 端子D 43 探索線 44 エスケープ・ライン 45 概略経路 21 Obstacle 22 Corner Point 23 Escape Line 31, 32, 33, 34 General Wiring Path 41 Terminal S 42 Terminal D 43 Search Line 44 Escape Line 45 General Path

Claims (1)

【特許請求の範囲】[Claims] 【請求項1】 集積回路やプリント基板の多層配線領域
における配線処理を接続網で接続された複数の計算機に
より並列処理する自動配線方式であって、 配線領域を層別にその層の配線方向に沿った帯状の配線
領域に分割して各計算機に分担させ、その際に同一の帯
状の配線領域を複数の計算機に分担させ、各計算機は、
自分の担当する帯状の配線領域に含まれる障害物及び、
障害物自体は隣の領域に存在するがデザイン・ルールに
よってその障害物が与える影響が自分の領域に及ぶとこ
ろの障害物の属性及び位置を記憶し、それらの障害物の
角からデザイン・ルールを満たす距離だけ離れた位置に
コーナー・ポイントを生成し、そのコーナー・ポイント
を基準としてその障害物を回避するエスケープ・ライン
を生成し、 おおまかな配線経路を示す概略配線経路は予め求めてお
き、 次に、あるネットの概略配線を含む領域を担当している
計算機グループは、その概略配線経路内のエスケープ・
ラインの中から、端子間を接続するための経路を探索
し、 計算機グループを構成する計算機が互いに重複しない計
算機グループは複数グループが同時に詳細配線を行なう
ことを特徴とする自動配線方式。
1. An automatic wiring system in which wiring processing in a multi-layer wiring area of an integrated circuit or a printed circuit board is processed in parallel by a plurality of computers connected by a connection network, and the wiring area is divided layer by layer along a wiring direction of the layer. Each computer is divided into separate strip-shaped wiring areas, and the same strip-shaped wiring area is shared by multiple computers.
Obstacles included in the strip-shaped wiring area that you are in charge of,
Obstacles themselves exist in the adjacent area, but remember the attributes and positions of obstacles where the influence of the obstacles on your area due to the design rules, and design rules from the corners of those obstacles. A corner point is generated at a distance that satisfies the condition, an escape line that avoids the obstacle is generated based on the corner point, and a rough wiring route showing a rough wiring route is obtained in advance. In addition, the computer group that is in charge of the area including the rough wiring of a certain net
An automatic wiring method that searches for a route to connect the terminals from the lines, and multiple computers perform detailed wiring at the same time for computer groups that do not overlap with each other.
JP3328213A 1991-11-15 1991-11-15 Automatic wiring method Expired - Lifetime JP3006244B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP3328213A JP3006244B2 (en) 1991-11-15 1991-11-15 Automatic wiring method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP3328213A JP3006244B2 (en) 1991-11-15 1991-11-15 Automatic wiring method

Publications (2)

Publication Number Publication Date
JPH05143691A true JPH05143691A (en) 1993-06-11
JP3006244B2 JP3006244B2 (en) 2000-02-07

Family

ID=18207716

Family Applications (1)

Application Number Title Priority Date Filing Date
JP3328213A Expired - Lifetime JP3006244B2 (en) 1991-11-15 1991-11-15 Automatic wiring method

Country Status (1)

Country Link
JP (1) JP3006244B2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010102486A (en) * 2008-10-23 2010-05-06 Fujitsu Ltd Printed board wiring processing device, printed board wiring processing program, printed board wiring processing method

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010102486A (en) * 2008-10-23 2010-05-06 Fujitsu Ltd Printed board wiring processing device, printed board wiring processing program, printed board wiring processing method

Also Published As

Publication number Publication date
JP3006244B2 (en) 2000-02-07

Similar Documents

Publication Publication Date Title
JPS63225869A (en) Wiring path search system
CN105205205B (en) FPGA coarse grain parallelism wiring methods based on netlist location information optimal dividing
JPH05143691A (en) Automatic wiring system
JP3006156B2 (en) Automatic wiring method
Cong Pin assignment with global routing
US5825659A (en) Method for local rip-up and reroute of signal paths in an IC design
JPH08286920A (en) Traveling salesman problem processor
JP2536640B2 (en) Wiring method
JP2523702B2 (en) Automatic wiring method for semiconductor integrated circuits
Zhou et al. A Global Routing Algorithm for PCB Based on Triangular Grid
Stojmenović Honeycomb networks
Cho et al. PARALLEX: a parallel approach to switchbox routing
Bokka et al. Constant-time algorithms for constrained triangulations on reconfigurable meshes
JPS62115574A (en) Parallel wiring system
JP3006140B2 (en) Automatic wiring method
JPH07202000A (en) Lsi wiring system by parallel processing
Pedram et al. Combining technology mapping with layout
Keshk Automated wire routing using parallel processing
JPH0652532B2 (en) Circuit board wiring route search method by CAD
Chen et al. Area Optimization of Slicing Floorplans in Parallel
JPS62243071A (en) Parallel arrangement improving system
JP2687699B2 (en) Parallel wiring processing method for integrated circuit
gurable Meshes email: olariu@ cs. odu. edu
Belkhale Parallel algorithms for CAD with applications to circuit extraction
JP2536119B2 (en) Wiring method

Legal Events

Date Code Title Description
A01 Written decision to grant a patent or to grant a registration (utility model)

Free format text: JAPANESE INTERMEDIATE CODE: A01

Effective date: 19991026

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20071126

Year of fee payment: 8

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20081126

Year of fee payment: 9

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20081126

Year of fee payment: 9

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20091126

Year of fee payment: 10

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20091126

Year of fee payment: 10

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20101126

Year of fee payment: 11

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20111126

Year of fee payment: 12

EXPY Cancellation because of completion of term