High-performance routing at the nanometer scale

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2007, Pages 496-502

  Roy, Jarrod A ^a   Markov, Igor L ^a  

^a Department of Ecology and Evolutionary Biology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPREHENSIVE ANALYSIS; COMPUTER-AIDED DESIGN; GLOBAL ROUTING; INTERNATIONAL CONFERENCES; NANO-METER SCALE; ROUTING TECHNIQUES; ROUTING TECHNOLOGIES; RUN-TIME; TOTAL WIRE LENGTH; WIRELENGTHS;

DESIGN; ROUTERS; ROUTING ALGORITHMS;

TECHNOLOGY;

EID: 43349099015     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2007.4397313     Document Type: Conference Paper

References (33)

1. S. N. Adya, I. L. Markov and P. G. Villarrubia, "On Whitespace and Stability in Physical Synthesis," Integration: the VLSI Journal 39(4). pp. 340-362, 2006.
2. C. Albrecht, "Global Routing by New Approximations for Multicommodity Flow." IEEE TCAD 20(5). pp. 622-632, 2001.
3. E. Bozorgzadeh. R. Kastner and M. Sarrafzadeh, "Creating and Exploiting Flexibility in Rectilinear Steiner Trees," IEEE TCAD 22(5), pp. 605-615, 2003.
4. M. Cho and D. Z. Pan, "BoxRouter: A New Global Router Based on Box Expansion and Progressive ILP." In Proc. DAC, pp. 373-378, 2006.
5. M. Clio, H. Xiang, R. Puri and D. Z. Pan, "Wire Density Driven Global Routing for CMP Variation and Timing." In Proc. ICCAD, pp. 487-492, 2006.
6. C. C. N. Chu and Y.-C. Wong, "Fast and Accurate Rectilinear Steiner Minimal Tree Algorithm for VLSI Design." In Proc. ISPD, pp. 28-35, 2005.
7. T. H. Cormen, C. E. Leiserson. R. L. Rivest and C. Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001.
8. W. A. Dees, Jr. and P. G. Karger, "Automated Rip-up and Reroute Techniques," In Proc. DAC. pp. 432-439, 1982.
9. R. Goering, "IC Routing Contest Boosts CAD Research," EE Times, March 22. 2007. http://www.eetimes.com/showArticle.jhtml?articleID=198500084
10. R. Hadsell and P. H. Madden, "Improved Global Routing through Congestion Estimation." In Proc. DAC, pp. 28-34. 2003.
11. J. Hu and S. S. Sapatnekar, "A Survey on Multi-net Global Routing for Integrated Circuits," Integration, the VLSI Journal 31(1), pp. 1-49, 2001.
12. ISPD 1998 Global Routing benchmark suite. http://www.ece.ucsb.edu/ ~kastner/labyrinth
13. ISPD 2007 Global Routing Contest and benchmark suite. http ://www.sigda.org/ispd2007/rcontest/
14. A. B. Kahng, I.I. Mandoiu and A. Zelikovsky, "Highly Scalable Algorithms for Rectilinear and Octilinear Steiner Trees," In Proc. ASP-DAC, pp. 827-833. 2003.
15. R. Kastner, E. Bozorgzadeh and M. Sarrafzadeh, "Pattern Routing: Use and Theory for Increasing Predictability and Avoiding Coupling," IEEE TCAD 21(7), pp. 777-790, 2002.
16. Lagrange multipliers. http://en.wikipedia.org/wiki/Lagrange_multipliers
17. K.-Y. Lee and T.-C. Wang, "Post-routing Redundant Via Insertion for Yield/Reliability Improvement," In Proc. ASP-DAC, pp. 303-308, 2006.
18. C.-W. Lin et. al., "Recent Research and Emerging Challenges in Physical Design for Manufacturability/Reliability." In Proc. ASP-DAC. pp. 238-243. 2007.
19. C.-W. Lin et. al., "Efficient Obstacle-avoiding Rectilinear Steiner Tree Construction," In Proc. ISPD, pp. 127-134, 2007.
20. D. McGrath, "Routing Technology Came from Within Cadence, execs say," EE Times, Sept. 8. 2006. http://www.eetimes.com/showArticle.jhtml? articleID=192700243
21. L. McMurchie and C. Ebeling, "PathFinder: A Negotiation-based Performance-driven Router for FPGAs." In Proc. FPGA, 1995.
22. M. Moffitt, Personal communication, March 2007.
23. M. Pan and C. Chu, "FastRoute: A Step to Integrate Global Routing into Placement," In Proc. ICCAD. pp. 464-471, 2006.
24. M. Pan and C. Chu, "FastRoute 2.0: A High-quality and Efficient Global Router." In Proc. ASP-DAC, pp. 250-255, 2007.
25. H. Ren, D. Z. Pan and P. G. Villarubia, "True Crosstalk Aware Incremental Placement with Noise Map," In Proc. ICCAD, pp. 402-409, 2004.
26. J. A. Roy and I. L. Markov, "Seeing the Forest and the Trees: Steiner Wirelength Optimization in Placement." IEEE TCAD 26(4), pp. 632-644, 2007.
27. L. K. Scheffer, "Physical CAD Changes to Incorporate Design for Lithography and Manufacturability," In Proc. ASP-DAC, pp. 768-773, 2004.
28. Z. Shen, C. C. N. Chu and Y. M. Li, "Efficient Rectilinear Steiner Tree Construction with Rectilinear Blockages," In Proc. ICCD, pp. 38-44, 2005.
29. K. So, "Solving Hard Instances of FPGA Routing with a CongestionOptimal Restrained-Norm Path Search Space," In Proc. ISPD, pp. 151-158, 2007.
30. P. V. Srinivas et. al., "System and Method for Estimating Capacitance of Wires Based on Congestion Information." U.S. Patent 6519745, filed May 26, 2000, issued Feb. 11, 2003.
31. D. C. Wang, "Method for Estimating Routability and Congestion in a Cell Placement for Integrated Circuit Chip," U.S. Patent 5587923, filed Sept. 7, 1994. issued Dec. 24, 1996.
32. J. Westra, C. Bartels and P. Groeneveld, "Probabilistic Congestion Prediction," In Proc. AVPD, pp. 204-209, 2004.
33. J. Westra and P. Groeneveld, "Is Probabilistic Congestion Estimation Worthwhile?", In Proc. SLIP, pp. 99-106, 2005.