Title :
Priority driven channel pin assignment
Author :
Peters, Ines ; Molitor, P.
Author_Institution :
Inst. fur Inf., Halle Univ., Germany
Abstract :
We present a polynomial time improvement of the linear channel pin assignment LCPA algorithms presented by Cai and Wong in 1990. We solve the LCPA problem according to minimum channel density under a special priority schedule subject to vertical constraints and flux. The priority driven linear channel pin assignment algorithm (PDCPA) reduces the channel height by an average of 17% without increasing the running time
Keywords :
VLSI; circuit layout CAD; computational complexity; integrated circuit layout; network routing; LCPA algorithms; VLSI; channel height; channel routing; linear channel pin assignment; minimum channel density; polynomial time improvement; priority driven channel pin assignment; priority schedule; running time; vertical constraints; Algorithm design and analysis; Circuits; Influenza; Joining processes; Pins; Polynomials; Processor scheduling; Routing; Scheduling algorithm; Very large scale integration;
Conference_Titel :
VLSI, 1995. Proceedings., Fifth Great Lakes Symposium on
Conference_Location :
Buffalo, NY
Print_ISBN :
0-8186-7035-5
DOI :
10.1109/GLSV.1995.516039
