Proceedings Article10.1145/1353629.1353648
Fast interconnect synthesis with layer assignment
Zhuo Li,Charles J. Alpert,Shiyan Hu,Tuhin Muhmud,Stephen T. Quay,Paul G. Villarrubia +5 more
- 13 Apr 2008
- pp 71-77
45
TL;DR: The importance of layer assignment over wire sizing is outlined, and efficient techniques to perform concurrent buffer insertion and layer assignment to fix the electrical and timing problems, while maintaining speed and efficient use of resources are presented.
read more
Abstract: As technology scaling advances beyond 65 nanometer node, more devices can fit onto a chip, which implies continued growth of design size. The increased wire delay dominance due to finer wire widths makes design closure an increasingly challenging problem. Interconnect synthesis techniques, such as buffer insertion/sizing and wire sizing, have proven to be the critical part of a successful timing closure optimization tool.Layer assignment, which was traditionally treated as same as wire sizing, is more effective and friendly in the design flow than wire sizing in the advanced technologies. Techniques for simultaneous layer assignment and buffer insertion with resource control are increasingly important for the quality of results of interconnect synthesis. This paper outlines the importance of layer assignment over wire sizing, and presents efficient techniques to perform concurrent buffer insertion and layer assignment to fix the electrical and timing problems, while maintaining speed and efficient use of resources
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
What makes a design difficult to route
Charles J. Alpert,Zhuo Li,Michael D. Moffitt,Gi-Joon Nam,Jarrod A. Roy,Gustavo E. Tellez +5 more
- 14 Mar 2010
TL;DR: This work overviews the complexities with modeling congestion during physical synthesis and discusses how optimizations may be able to provide some relief.
71
Delay-driven layer assignment in global routing under multi-tier interconnect structure
Jianchang Ao,Sheqin Dong,Song Chen,Satoshi Goto +3 more
- 24 Mar 2013
TL;DR: This work presents a two-stage algorithm to solve the layer assignment problem under multi-tier interconnect structure, which first minimizes the total delay and via count simultaneously by dynamic programming and negotiation technique, and then further minimized the maximum delay carefully while not increasing the via count.
Guiding a physical design closure system to produce easier-to-route designs with more predictable timing
Zhuo Li,Charles J. Alpert,Gi-Joon Nam,Cliff Sze,Natarajan Viswanathan,Nancy Zhou +5 more
- 03 Jun 2012
TL;DR: A series of techniques that may relieve the problem of routing challenges, and guide the physical design closure system to produce not only easier to route designs, but also better timing quality are discussed.
23
TILA-S: Timing-Driven Incremental Layer Assignment Avoiding Slew Violations
TL;DR: A timing driven incremental layer assignment tool, to reassign layers among routing segments of critical nets and noncritical nets, and Lagrangian relaxation techniques are proposed to iteratively provide consistent layer/via assignments.
23
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
Shiyan Hu,Zhuo Li,Charles J. Alpert +2 more
- 26 Jul 2009
TL;DR: The first fully polynomial time approximation scheme for the timing driven minimum cost buffer insertion problem is designed and can approximate the optimal buffering solution within a factor of 1 + ε running in O(m2n2b/ε3 + n3b2/ε) time.
22
References
Buffer placement in distributed RC-tree networks for minimal Elmore delay
L.P.P.P. van Ginneken
- 01 May 1990
TL;DR: An algorithm is presented for choosing the buffer positions for a wiring tree such that the Elmore delay is minimal, and an extension of the basic algorithm allows minimization of the number of buffers as a secondary objective.
543
Optimal wire sizing and buffer insertion for low power and a generalized delay model
TL;DR: This approach represents the first work on buffer insertion to incorporate signal slew into the delay model while guaranteeing optimality and efficiently computes the complete, optimal power-delay trade-off curve for added design flexibility.
305
Fast and exact simultaneous gate and wire sizing by Lagrangian relaxation
Chung-Ping Chen,Chris Chu,D. F. Wong +2 more
- 01 Nov 1998
TL;DR: A fast and exact algorithm which can minimize total area subject to maximum delay bound and is based on Lagrangian relaxation and "one-gate/wire-at-a-time" local optimizations, and is extremely economical and fast.
Performance-Driven Interconnect Design Based on Distributed RC Delay Model
Jason Cong,Kwok-Shing Leung,Dian Zhou +2 more
- 01 Jul 1993
TL;DR: It is shown that interconnect topology optimization can be achieved by computing optimal generalized rectilinear Steiner arborescences and an efficient algorithm is presented which yields optimal or near-optimal solutions.
189