ACM Home Page
Please provide us with feedback. Feedback
Timing driven track routing considering coupling capacitance
Full text PdfPdf (347 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2005 Asia and South Pacific Design Automation Conference table of contents
Shanghai, China
SESSION: Poster session III table of contents
Pages: 1156 - 1159  
Year of Publication: 2005
ISBN:0-7803-8737-6
Authors
Di Wu  Texas A&M University, College Station, TX
Jiang Hu  Texas A&M University, College Station, TX
Min Zhao  Freescale Semiconductor, Austin, TX
Rabi Mahapatra  Texas A&M University, College Station, TX
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
: Shanghai IC Industry Association
: IEEE SSCS Shanghai Chapter
: IEEE CAS
: IEEE Beijing Section
: Fudan University
: Chinese Institute of Electronics
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 30,   Citation Count: 4
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1120725.1120929
What is a DOI?

ABSTRACT

As VLSI technology enters the ultra-deep submicron era, wire coupling capacitance starts to dominate self capacitance and can no longer be neglected in timing driven routing. In this paper, a coupling aware timing driven track routing heuristic is proposed. Given a global routing solution and timing constraint for each net, major trunks of wire segments are assigned to routing tracks such that the minimum timing slack among all nets is maximized. Delay penalties from both coupling capacitance and wire detour are considered in a unified graph model. The core problem is formulated and solved as a Sequential Ordering Problem (SOP). Routing blockages are handled in a post processing procedure. The experimental results on benchmark circuits show that the effect of coupling capacitance on timing is significant and the proposed heuristic results in greater improvement on coupling aware timing compared with other approaches.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
X. Hong, T. Xue, J. Huang, C.-K. Cheng, and E. S. Kuh. TIGER: an efficient timing-driven global router for gate array and standard cell layout design. IEEE TCAD, 16(11):1323--1331, November 1997.
 
2
J. Hu and S. S. Sapatnekar. A timing-constrained simultaneous global routing algorithm. IEEE TCAD, 21(9):1025--1036, September 2002.
3
 
4
T. Gao and C. L. Liu. Minimum crosstalk channel routing. IEEE TCAD, 15(5):465--474, May 1996.
 
5
A. Vittal and M. Marek-Sadowska. Crosstalk reduction for VLSI. IEEE TCAD, 16(3):290--298, March 1997.
 
6
T. Xue, E. S. Kuh, and D. Wang. Post global routing crosstalk synthesis. IEEE TCAD, 16(12):1418--1430, December 1997.
7
 
8
H. Zhou and D. F. Wong. Global routing with crosstalk constraints. IEEE TCAD, 18(11):1683--1688, 1999.
9
 
10
C.-C. Chang and J. Cong. Pseudopin assignment with crosstalk noise control. IEEE TCAD, 20(5):598--611, May 2001.
 
11
J. Cong, L. He, C.-K. Koh, and Z. Pan. Interconnect sizing and spacing with consideration of coupling capacitance. IEEE TCAD, 20(9):1164--1169, September 2001.
12
 
13
P. Saxena and S. Gupta. On integrating power and signal routing for shield count minimization in congested regions. IEEE TCAD, 22(4):437--445, April 2003.
 
14
15
16
 
17
H.-P. Tseng, L. Sheffer, and C. Sechen. Timing- and crosstalk- driven area routing. IEEE TCAD, 20(4):528--544, April 2001.
18
 
19
S. Chen and S. Smith Commonality and genetic algorithm. Technical Report CMU-RI-TR-96-27, Carnegie Mellon University, Pittsburgh, 1996. http://www-2.cs.cmu.edu/ chens/

Collaborative Colleagues:
Di Wu: colleagues
Jiang Hu: colleagues
Min Zhao: colleagues
Rabi Mahapatra: colleagues