MINIMUM SEPARATION FOR SINGLE-LAYER CHANNEL ROUTING

被引：5

作者：

GREENBERG, RI

MALEY, FM

机构：

[1] UNIV MARYLAND,INST ADV COMP STUDIES,COLL PK,MD 20742

[2] PRINCETON UNIV,DEPT MATH,PRINCETON,NJ 08544

来源：

INFORMATION PROCESSING LETTERS | 1992年 / 43卷 / 04期

基金：

美国国家科学基金会;

关键词：

ALGORITHMS; CHANNEL ROUTING; RIVER ROUTING; ROUTABILITY; VLSI LAYOUT;

D O I：

10.1016/0020-0190(92)90201-6

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We present a linear-time algorithm for determining the minimum height of a single-layer routing channel. The algorithm handles single-sided connections and multiterminal nets. It yields a simple routability test for single-layer switchboxes, correcting an error in the literature.

引用

页码：201 / 205

页数：5

共 9 条

[1]

Baker B. S., 1983, 24th Annual Symposium on Foundations of Computer Science, P360, DOI 10.1109/SFCS.1983.6

[2]

CHANG SC, 1989, TR8946 U MAR I ADV C

[3]

Cole R., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P65, DOI 10.1109/SFCS.1984.715902

[4]

DOLEV D, 1981, 13TH P ANN ACM S THE, P312

[5]

GREENBERG RI, 1988, P IEEE INT C COMP AI, P88

[6]

Lengauer T., 1990, COMBINATORIAL ALGORI

[7] RIVER ROUTING IN VLSI [J].

MIRZAIAN, A .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1987, 34 (01) :43-54

[8]

Pinter R. Y., 1983, Third Caltech Conference on Very Large Scale Integration, P141

[9]

[No title captured]

← 1 →