Priority driven channel pin assignment

Abstract

We present a polynomial time improvement of the linear channel pin assignment LCPA algorithms presented by Gai and Wong in 1990. We solve the LCPA problem according to minimum channel density under a special priority schedule subject t o vertical constraints and jlux. The priority driven linear channel pin assignment algorithm (PDCPA) reduces the channel height b y an average of 17 % without increasing the running time'.