Efficient octilinear Steiner tree construction based on spanning graphs

Authors:
Qi Zhu;Hai Zhou;Tong Jing;Xianlong Hong;Yang Yang
Affiliations:
Tsinghua Univ., Beijing, P. R. China;Northwestern Univ., Evanston, IL;Tsinghua Univ., Beijing, P. R. China;Tsinghua Univ., Beijing, P. R. China;Tsinghua Univ., Beijing, P. R. China
Venue:
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Year:
2004

Citing 9
Cited 6

Introduction to algorithms

Introduction to algorithms
On optimal interconnections

On optimal interconnections
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees

Journal of the ACM (JACM)
Manhattan or non-Manhattan?: a study of alternative VLSI routing architectures

GLSVLSI '00 Proceedings of the 10th Great Lakes symposium on VLSI
The X architecture: not your father's diagonal wiring

SLIP '02 Proceedings of the 2002 international workshop on System-level interconnect prediction
Efficient minimum spanning tree construction without Delaunay triangulation

Information Processing Letters
Efficient Steiner tree construction based on spanning graphs

Proceedings of the 2003 international symposium on Physical design
Constructing exact octagonal steiner minimal trees

Proceedings of the 13th ACM Great Lakes symposium on VLSI
Highly scalable algorithms for rectilinear and octilinear Steiner trees

ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference

Multilevel full-chip routing for the X-based architecture

Proceedings of the 42nd annual Design Automation Conference
The polygonal contraction heuristic for rectilinear Steiner tree construction

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Timing-driven octilinear Steiner tree construction based on Steiner-point reassignment and path reconstruction

ACM Transactions on Design Automation of Electronic Systems (TODAES)
PIXAR: A performance-driven X-architecture router based on a novel multilevel framework

Integration, the VLSI Journal
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both based on octilinear spanning graphs. The one by edge substitution (OST-E) has a worst case running time of O(nlogn) and similar performance as the batched greedy algorithm[9]. The other one by triangle contraction (OST-T) has a small increase in running time and better performance. Experiments on both industry and random test cases are conducted.