A new model for general connectivity and its application to placement

A new model for general connectivity is defined and its application to placement is presented in this paper. The new model is based on better understanding and analysis of connection graphs. Its computation time in the worst case is O(N^k+2), where N is the number of cells in a connection graph and k is the order of general connectivity. 41 placements for three circuits were carried out with our new model and the results are compared with those from the conductance model proposed by an earlier paper. Our new model is better than the conductance model because ours characterizes the connection graph more accurately, is faster to compute, and produces better results. The best performance improvements for the three circuits are 35.4% (HK5601), 37.8%(HK5852), and 19.2%(HK5851)