A new algorithm for standard cell global routing

DOI10.1016/0167-9260(92)90010-VMaRDI QIDQ4015492zbMATH OpenFDO

Authors Jason Cong, Bryan Preas

Publication date 13 January 1993

Published in Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-9260(92)90010-V

zbMATH Keywords

global routingspanning forestsstandard cell design

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Circuits, networks (94C99)

Recommendations

• Routing Algorithms for Cellular Interconnection Arrays
• A new algorithm for routing in ad-hoc network
• An algorithm of cell search in broadband wireless access systems
• An efficient algorithm for channel assignment in cellular mobile networks
• Multiterminal global routing: A deterministic approximation scheme
• New heuristic algorithm for channel assignment in cellular mobile systems
• An efficient algorithm for global path optimization in MPLS networks

Cited in

(9)

• SSTT: Efficient local search for GSI global routing
• CNB: a critical-network-based timing optimization method for standard cell global routing
• Faster goal-oriented shortest path search for bulk and incremental detailed routing
• Provably good global routing of integrated circuits
• Amaterous: A parallel wire router without detailed/global feedback
• A provably tight delay-driven concurrently congestion mitigating global routing algorithm
• Probability-driven routing in a datapath environment
• scientific article; zbMATH DE number 946301 (Why is no real title available?)
• Faster goal-oriented shortest path search for bulk and incremental detailed routing

Describes a project that uses

Uses Software

• TimberWolf

This page was built for publication: A new algorithm for standard cell global routing

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