CHANNEL ROUTERS FOR LSI LAYOUT USING MERGING TECHNIQUES.

Takeshi Yoshimura

研究成果: Article

3 引用 (Scopus)

抄録

TWO NEW ALGORITHMS ARE PROPOSED FOR THE CHANNEL ROUTING PROBLEM IN THE LAYOUT DESIGN OF LSI CHIPS. ONE OF THE ALGORITHMIS A SIMPLE ONE AND IT DEPENDS ON A PROCESS OF MERGING NETSINSTEAD OF ASSIGNING HORIZONTAL TRACKS TO INDIVIDUAL NETS. THE OTHER IS BASED ON THE SAME IDEA, BUT IT USES A MATCHING ALGORITHM TO IMPROVE THE SOLUTION. THE ALGORITHMS WERE CODEDIN FORTRAN AND IMPLEMENTED ON A VAX 11/780 COMPUTER. EXPERIMENTAL RESULTS ARE QUITE ENCOURAGING. BOTH PROGRAMS GENERATED OPTIMAL SOLUTIONS IN 6 OF 8 CASES, USING EXAMPLES IN PREVIOUSLY PUBLISHED PAPERS. THE COMPUTATION TIMES OF THE ALGORITHMS FOR A TYPICAL CHANNEL (300 TERMINAL, 70 NETS) WERE 1. 0 SECOND AND 2. 1 SECONDS, RESPECTIVELY.

元の言語English
ページ(範囲)25-35
ページ数11
ジャーナルNEC RES DEV
発行部数N 66
出版物ステータスPublished - 1982 7
外部発表Yes

Fingerprint

Merging
Routers
FORTRAN (programming language)

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

これを引用

CHANNEL ROUTERS FOR LSI LAYOUT USING MERGING TECHNIQUES. / Yoshimura, Takeshi.

:: NEC RES DEV, 番号 N 66, 07.1982, p. 25-35.

研究成果: Article

Yoshimura, T 1982, 'CHANNEL ROUTERS FOR LSI LAYOUT USING MERGING TECHNIQUES.', NEC RES DEV, 番号 N 66, pp. 25-35.
Yoshimura, Takeshi. / CHANNEL ROUTERS FOR LSI LAYOUT USING MERGING TECHNIQUES. :: NEC RES DEV. 1982 ; 番号 N 66. pp. 25-35.
@article{cef55d4ed6f94449a555dd1bd9f84469,
title = "CHANNEL ROUTERS FOR LSI LAYOUT USING MERGING TECHNIQUES.",
abstract = "TWO NEW ALGORITHMS ARE PROPOSED FOR THE CHANNEL ROUTING PROBLEM IN THE LAYOUT DESIGN OF LSI CHIPS. ONE OF THE ALGORITHMIS A SIMPLE ONE AND IT DEPENDS ON A PROCESS OF MERGING NETSINSTEAD OF ASSIGNING HORIZONTAL TRACKS TO INDIVIDUAL NETS. THE OTHER IS BASED ON THE SAME IDEA, BUT IT USES A MATCHING ALGORITHM TO IMPROVE THE SOLUTION. THE ALGORITHMS WERE CODEDIN FORTRAN AND IMPLEMENTED ON A VAX 11/780 COMPUTER. EXPERIMENTAL RESULTS ARE QUITE ENCOURAGING. BOTH PROGRAMS GENERATED OPTIMAL SOLUTIONS IN 6 OF 8 CASES, USING EXAMPLES IN PREVIOUSLY PUBLISHED PAPERS. THE COMPUTATION TIMES OF THE ALGORITHMS FOR A TYPICAL CHANNEL (300 TERMINAL, 70 NETS) WERE 1. 0 SECOND AND 2. 1 SECONDS, RESPECTIVELY.",
author = "Takeshi Yoshimura",
year = "1982",
month = "7",
language = "English",
pages = "25--35",
journal = "NEC Research and Development",
issn = "0048-0436",
publisher = "NEC Media Products Ltd.",
number = "N 66",

}

TY - JOUR

T1 - CHANNEL ROUTERS FOR LSI LAYOUT USING MERGING TECHNIQUES.

AU - Yoshimura, Takeshi

PY - 1982/7

Y1 - 1982/7

N2 - TWO NEW ALGORITHMS ARE PROPOSED FOR THE CHANNEL ROUTING PROBLEM IN THE LAYOUT DESIGN OF LSI CHIPS. ONE OF THE ALGORITHMIS A SIMPLE ONE AND IT DEPENDS ON A PROCESS OF MERGING NETSINSTEAD OF ASSIGNING HORIZONTAL TRACKS TO INDIVIDUAL NETS. THE OTHER IS BASED ON THE SAME IDEA, BUT IT USES A MATCHING ALGORITHM TO IMPROVE THE SOLUTION. THE ALGORITHMS WERE CODEDIN FORTRAN AND IMPLEMENTED ON A VAX 11/780 COMPUTER. EXPERIMENTAL RESULTS ARE QUITE ENCOURAGING. BOTH PROGRAMS GENERATED OPTIMAL SOLUTIONS IN 6 OF 8 CASES, USING EXAMPLES IN PREVIOUSLY PUBLISHED PAPERS. THE COMPUTATION TIMES OF THE ALGORITHMS FOR A TYPICAL CHANNEL (300 TERMINAL, 70 NETS) WERE 1. 0 SECOND AND 2. 1 SECONDS, RESPECTIVELY.

AB - TWO NEW ALGORITHMS ARE PROPOSED FOR THE CHANNEL ROUTING PROBLEM IN THE LAYOUT DESIGN OF LSI CHIPS. ONE OF THE ALGORITHMIS A SIMPLE ONE AND IT DEPENDS ON A PROCESS OF MERGING NETSINSTEAD OF ASSIGNING HORIZONTAL TRACKS TO INDIVIDUAL NETS. THE OTHER IS BASED ON THE SAME IDEA, BUT IT USES A MATCHING ALGORITHM TO IMPROVE THE SOLUTION. THE ALGORITHMS WERE CODEDIN FORTRAN AND IMPLEMENTED ON A VAX 11/780 COMPUTER. EXPERIMENTAL RESULTS ARE QUITE ENCOURAGING. BOTH PROGRAMS GENERATED OPTIMAL SOLUTIONS IN 6 OF 8 CASES, USING EXAMPLES IN PREVIOUSLY PUBLISHED PAPERS. THE COMPUTATION TIMES OF THE ALGORITHMS FOR A TYPICAL CHANNEL (300 TERMINAL, 70 NETS) WERE 1. 0 SECOND AND 2. 1 SECONDS, RESPECTIVELY.

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

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

M3 - Article

SP - 25

EP - 35

JO - NEC Research and Development

JF - NEC Research and Development

SN - 0048-0436

IS - N 66

ER -