๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new algorithm for standard cell global routing

โœ Scribed by Jason Cong; Bryan Preas

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
995 KB
Volume
14
Category
Article
ISSN
0167-9260

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Parallel Algorithm for Global Routing
A Parallel Algorithm for Global Routing Using an Associative Processor
โœ Taegeun Park ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 372 KB

This paper proposes a parallel approach to global routing using an associative processor (AP). The proposed architecture, which is very efficient for search-oriented applications, consists of three main functional blocks: the content-addressable memory (CAM) array, the row logic, and the control sec

An efficient hierarchical timing-driven
An efficient hierarchical timing-driven Steiner tree algorithm for global routing
โœ Jingyu Xu; Xianlong Hong; Tong Jing; Yici Cai; Jun Gu ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 425 KB

In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as the goal. The algorithm uses heuristic approach to decompose the problem of minimum delay Steiner tree into hierarchy and

A new proximal decomposition algorithm f
A new proximal decomposition algorithm for routing in telecommunication networks
โœ Mahey, P.; Ouorou, A.; LeBlanc, L.; Chifflet, J. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 125 KB ๐Ÿ‘ 2 views

We present a new and much more efficient implementation of the proximal decomposition algorithm for routing in congested telecommunication networks. The routing model that we analyze is a static one intended for use as a subproblem in a network design context. After describing our new implementation