A preprocessor for the via minimization problem

Authors:
K. C. Chang;H. C. Du
Affiliations:
Department of Computer Science, University of Minnesota, Minneapolis, Minnesota;Department of Computer Science, University of Minnesota, Minneapolis, Minnesota
Venue:
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Year:
1986

Citing 4
Cited 0

An algorithm for finding a fundamental set of cycles of a graph

Communications of the ACM
An optimum layer assignment for routing in ICs and PCBs.

DAC '81 Proceedings of the 18th Design Automation Conference
Wire routing by optimizing channel assignment within large apertures

DAC '71 Proceedings of the 8th Design Automation Workshop
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The objective of the via minimization is to assign wire segments into different layers to minimize the number of vias required. Several algorithms have been proposed for the Constrained Via Minimization (CVM) problem where the topology of the given layout is fixed. In a CVM problem, some vias may be “essential” to the given layout. That is, they have to be selected and cannot be replaced by other vias. In this paper we present a procedure to find most of the essential vias. This procedure can be used as a preprocessor for the algorithms for CVM problems. Experimental results show that the procedure is efficient and can identify most of essential vias.