Creating and exploiting flexibility in steiner trees
Proceedings of the 38th annual Design Automation Conference
The X architecture: not your father's diagonal wiring
SLIP '02 Proceedings of the 2002 international workshop on System-level interconnect prediction
The Steiner Minimal Tree Problem in the lambda-Geormetry Plane
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Some NP-complete geometric problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Steiner tree algorithms
Efficient octilinear Steiner tree construction based on spanning graphs
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Multilevel full-chip routing for the X-based architecture
Proceedings of the 42nd annual Design Automation Conference
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Revisiting fidelity: a case of elmore-based Y-routing trees
Proceedings of the 2008 international workshop on System level interconnect prediction
PIXAR: A performance-driven X-architecture router based on a novel multilevel framework
Integration, the VLSI Journal
Timing-driven non-rectangular obstacles-avoiding routing algorithm for the X-architecture
IMCAS'09 Proceedings of the 8th WSEAS international conference on Instrumentation, measurement, circuits and systems
WSEAS Transactions on Circuits and Systems
Approximation of octilinear steiner trees constrained by hard and soft obstacles
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Hardness and approximation of octilinear steiner trees
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
SAMOS'05 Proceedings of the 5th international conference on Embedded Computer Systems: architectures, Modeling, and Simulation
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
| Hi-index | 0.00 |
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using edges composed of line segments having one of four equally spaced orientations. The concept of a canonical form is introduced providing a strong framework for the structure and characteristics of OSMTs. An exact algorithm and a variety of pruning techniques are introduced. Random and OR Library instances are solved and compared against rectilinear and Euclidean SMTs. These experiments demonstrate the utility of pervasive octagonal routing, showing that octagonal SMTs are consistently 10% smaller than rectilinear SMTs.