By Topic

Shrubbery: a new algorithm for quickly growing high-quality Steiner trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
G. Grewal ; Guelph Univ., Ont., Canada ; T. Wilson ; M. Xu ; D. Banerji

As we move to deep sub-micron designs below 0.18 microns, the delay, area, and power dissipation of a circuit is dominated by the interconnections (routes) between the transistors. The interconnection pattern for each set of pins that must be connected (net) is a Steiner tree, and the primary sub-problem in (global) routing is to find a minimal Steiner tree. In this paper, we present a new algorithm, called "shrubbery, "for solving the Steiner tree problem. We evaluate the performance of shrubbery by running simulations with a large number of benchmarks from SteinLib and comparing our results to those obtained with the very popular Shortest Path Heuristic (SPH) developed by Takahashi and Matsuyama. Our results show that shrubbery is able to consistently find optimal or near optimal solutions, but in less time than SPH.

Published in:

VLSI Design, 2004. Proceedings. 17th International Conference on

Date of Conference: