EFFICIENT ALGORITHMS FOR CHANNEL ROUTING.

Takeshi Yoshimura, Ernest S. Kuh

研究成果: Article

290 引用 (Scopus)

抄録

In the layout design of LSI chips, channel routing is one of the key problems. The problem is to route a specified net list between two rows of terminals across a two-layer channel. Nets are routed with horizontal segments on one layer and vertical segments on the other. Connections between two layers are made through via holes. Two new algorithms are proposed. These algorithms merge nets instead of assigning horizontal tracks to individual nets. The algorithms were coded in Fortran and implemented on a VAX 11/780 computer. Experimental results are quite encouraging. Both programs generated optimal solutions in 6 out of 8 cases, using examples in previously published papers. The computation times of the algorithms for a typical channel (300 terminals, 70 nets) are 1. 0 and 2. 1 s, respectively.

元の言語English
ページ(範囲)25-35
ページ数11
ジャーナルIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
CAD-1
発行部数1
出版物ステータスPublished - 1982 1
外部発表Yes

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Hardware and Architecture
  • Electrical and Electronic Engineering

これを引用

EFFICIENT ALGORITHMS FOR CHANNEL ROUTING. / Yoshimura, Takeshi; Kuh, Ernest S.

:: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 巻 CAD-1, 番号 1, 01.1982, p. 25-35.

研究成果: Article

Yoshimura, Takeshi ; Kuh, Ernest S. / EFFICIENT ALGORITHMS FOR CHANNEL ROUTING. :: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 1982 ; 巻 CAD-1, 番号 1. pp. 25-35.
@article{ac4d60c6a6a64a989233a958aa17222b,
title = "EFFICIENT ALGORITHMS FOR CHANNEL ROUTING.",
abstract = "In the layout design of LSI chips, channel routing is one of the key problems. The problem is to route a specified net list between two rows of terminals across a two-layer channel. Nets are routed with horizontal segments on one layer and vertical segments on the other. Connections between two layers are made through via holes. Two new algorithms are proposed. These algorithms merge nets instead of assigning horizontal tracks to individual nets. The algorithms were coded in Fortran and implemented on a VAX 11/780 computer. Experimental results are quite encouraging. Both programs generated optimal solutions in 6 out of 8 cases, using examples in previously published papers. The computation times of the algorithms for a typical channel (300 terminals, 70 nets) are 1. 0 and 2. 1 s, respectively.",
author = "Takeshi Yoshimura and Kuh, {Ernest S.}",
year = "1982",
month = "1",
language = "English",
volume = "CAD-1",
pages = "25--35",
journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
issn = "0278-0070",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - EFFICIENT ALGORITHMS FOR CHANNEL ROUTING.

AU - Yoshimura, Takeshi

AU - Kuh, Ernest S.

PY - 1982/1

Y1 - 1982/1

N2 - In the layout design of LSI chips, channel routing is one of the key problems. The problem is to route a specified net list between two rows of terminals across a two-layer channel. Nets are routed with horizontal segments on one layer and vertical segments on the other. Connections between two layers are made through via holes. Two new algorithms are proposed. These algorithms merge nets instead of assigning horizontal tracks to individual nets. The algorithms were coded in Fortran and implemented on a VAX 11/780 computer. Experimental results are quite encouraging. Both programs generated optimal solutions in 6 out of 8 cases, using examples in previously published papers. The computation times of the algorithms for a typical channel (300 terminals, 70 nets) are 1. 0 and 2. 1 s, respectively.

AB - In the layout design of LSI chips, channel routing is one of the key problems. The problem is to route a specified net list between two rows of terminals across a two-layer channel. Nets are routed with horizontal segments on one layer and vertical segments on the other. Connections between two layers are made through via holes. Two new algorithms are proposed. These algorithms merge nets instead of assigning horizontal tracks to individual nets. The algorithms were coded in Fortran and implemented on a VAX 11/780 computer. Experimental results are quite encouraging. Both programs generated optimal solutions in 6 out of 8 cases, using examples in previously published papers. The computation times of the algorithms for a typical channel (300 terminals, 70 nets) are 1. 0 and 2. 1 s, respectively.

UR - http://www.scopus.com/inward/record.url?scp=0019923262&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019923262&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0019923262

VL - CAD-1

SP - 25

EP - 35

JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

SN - 0278-0070

IS - 1

ER -