Title :
An application algorithm for the via minimization problem in channel routing
Author_Institution :
Dept. of Math. & Comput. Sci., Tennessee Univ., Martin, TN, USA
Abstract :
It is shown that the problem of via minimization in VLSI routing with movable terminals can be solved in O(n log n ) time by using the algorithm finding a maximum independent set in a permutation graph. It is also shown that the nets of an example are routed with fewer tracks and vias. Therefore, the number of vias is reduced by using a correct algorithm rather than an algorithm finding a length of largest up-sequence
Keywords :
VLSI; algorithm theory; circuit layout; computational complexity; graph theory; minimisation; monolithic integrated circuits; VLSI routing; channel routing; maximum independent set; movable terminals; permutation graph; via minimization problem; Computer science; Fabrication; Integrated circuit interconnections; Integrated circuit layout; Joining processes; Minimization methods; Propagation delay; Routing; Topology; Wire;
Conference_Titel :
Applied Computing, 1990., Proceedings of the 1990 Symposium on
Conference_Location :
Fayetteville, AR
Print_ISBN :
0-8186-2031-5
DOI :
10.1109/SOAC.1990.82157
