SSTT: Efficient local search for GSI global routing

DOI10.1007/BF02947123MaRDI QIDQ1412147zbMATH OpenOpenAlexFDO

Authors Tong Jing, HaiYun Bao, Xianlong Hong

Publication date 6 November 2003

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02947123

zbMATH Keywords

search space traversing technologySSTT global routing algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• A new algorithm for standard cell global routing
• Provably good global routing of integrated circuits
• Faster goal-oriented shortest path search for bulk and incremental detailed routing
• A provably tight delay-driven concurrently congestion mitigating global routing algorithm
• Integer Programming and Combinatorial Optimization

Cites work

• Convergence of an annealing algorithm
• Optimization by simulated annealing
• The Rectilinear Steiner Tree Problem is NP-Complete

Cited in

(1)

• CNB: a critical-network-based timing optimization method for standard cell global routing

This page was built for publication: SSTT: Efficient local search for GSI global routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1412147)