Experiments with a Density Router for PC Cards
- 1 March 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-28 (3) , 262-267
- https://doi.org/10.1109/tc.1979.1675333
Abstract
In this correspondence a new routing cost function is defined which is a function of local blockage density in addition to path length. A parameter α specifies the degree to which density is to influence the cost. The use of such a cost function results in what we refer to as a density router. The classical Lee router is a special case of the density router with α equal to 0. We present four performance measures (two of which are based on the density of blockages) for comparing the performance of the classical Lee router with that of the density router. It is experimentally determined that a value of a of about 1.25 optimizes our cost function for the density router when evaluated according to each of the four performance measures and for the board model assumed.Keywords
This publication has 4 references indexed in Scilit:
- On the probability of success in a routing processProceedings of the IEEE, 1976
- On the Ordering of Connections for Automatic Wire RoutingIEEE Transactions on Computers, 1972
- ACCEL: Automated circuit card etching layoutProceedings of the IEEE, 1967
- An Algorithm for Path Connections and Its ApplicationsIEEE Transactions on Electronic Computers, 1961