Please use this identifier to cite or link to this item:
|Title:||Switchbox routing using score function|
|Authors:||Tan, K.-P. |
|Source:||Tan, K.-P.,Tan, T.-S. (1989-10). Switchbox routing using score function. Integration, the VLSI Journal 8 (1) : 17-39. ScholarBank@NUS Repository.|
|Abstract:||A new heuristic algorithm, namely Score Function Switchbox Router, is proposed for the switchbox routing problem. It considers routing from the boundary of the switchbox inward using techniques such as figure of merit (or score function), unique route detection, and minimal rectilinear Steiner tree to achieve the three objectives of entire routability, minimizing wire length and number of vias. The algorithm is implemented on an Apollo DN580 graphics workstation and tested with examples taken from previous literatures. Experiment shows that it completes the routing for all routable cases, including the benchmark example of Burstein's difficult switchbox, in the order of a few seconds. Most encouraging of all, it is the only algorithm, using the traditional wiring model of having vertical and horizontal wires on two separate layers, that produces a solution fully automatic for the Burstein's difficult switchbox without even using the last column. © 1989.|
|Source Title:||Integration, the VLSI Journal|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.