Table of Contents Author Guidelines Submit a Manuscript
VLSI Design
Volume 2009 (2009), Article ID 537341, 13 pages
http://dx.doi.org/10.1155/2009/537341
Research Article

A Multilevel Congestion-Based Global Router

1Department of Electrical and Computer Engineering, Schulich School of Engineering, University of Calgary, Calgary, AB, Canada T2N 1N4
2School of Engineering, University of Guelph, Guelph, ON, Canada N1G 2W1
3Department of Industrial and Systems Engineering, P. C. Rossin College of Engineering and Applied Science, Lehigh University, Bethlehem, PA 18015, USA

Received 17 February 2009; Revised 13 July 2009; Accepted 2 September 2009

Academic Editor: David S. Kung

Copyright © 2009 Logan Rakai et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Cong, “Challenges and opportunities for design innovations in nanometer technologies,” in Frontiers in Semiconductor Research: A Collection of SRC Working Papers, pp. 54–57, Semiconductor Research, San Jose, Calif, USA, 1997. View at Google Scholar
  2. “International technology roadmap for semiconductors report,” November 2007, http://www.itrs.net/Links/2007ITRS/Home2007.htm.
  3. “ISPD2007 Global Routing Contest,” June 2008, http://www.sigda.org/ispd2007.
  4. “ISPD2008 Global Routing Contest,” June 2008, http://www.ispd.cc/contests.
  5. J. Lou, S. Thakur, S. Krishnamoorthy, and H. S. Sheng, “Estimating routing congestion using probabilistic analysis,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 21, no. 1, pp. 32–41, 2002. View at Publisher · View at Google Scholar · View at Scopus
  6. S.-P. Lin and Y.-W. Chang, “A novel framework for multilevel routing considering routability and performance,” in Proceedings of IEEE/ACM International Conference on Computer-Aided Design (ICCAD '02), pp. 44–50, ACM, New York, NY, USA, 2002. View at Scopus
  7. R. T. Hadsell and P. H. Madden, “Improved global routing through congestion estimation,” in Proceedings of the 40th Conference on Design Automation (DAC '03), pp. 28–31, ACM, New York, NY, USA, 2003. View at Scopus
  8. M. Cho and D. Z. Pan, “BoxRouter: a new global router based on box expansion and progressive ILP,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 26, no. 12, pp. 2130–2143, 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. J. Westra, C. Bartels, and P. Groeneveld, “Probabilistic congestion prediction,” in Proceedings of the International Symposium on Physical Design (ISPD '04), pp. 204–209, Phoenix, Ariz, USA, 2004. View at Scopus
  10. A. B. Kahng and X. Xu, “Accurate pseudo-constructive wirelength and congestion estimation,” in Proceedings of the International Workshop on System Level Interconnect Prediction (SLIP '03), pp. 61–68, 2003. View at Scopus
  11. J. A. Roy and I. L. Markov, “High-performance routing at the nanometer scale,” in Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD '07), pp. 496–502, IEEE/ACM, Piscataway, NJ, USA, 2007. View at Publisher · View at Google Scholar · View at Scopus
  12. Y.-J. Chang, Y.-T. Lee, and T.-C. Wang, “NTHU-route 2.0: a fast and stable global router,” in Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD '08), pp. 338–343, November 2008. View at Publisher · View at Google Scholar · View at Scopus
  13. C.-H. Hsu, H.-Y. Chen, and Y.-W. Chang, “Multi-layer global routing considering via and wire capacities,” in Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD '08), pp. 350–355, November 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. Y. Zhang, Y. Xu, and C. Chu, “FastRoute3.0: a fast and high quality global router based on virtual capacity,” Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD '08), pp. 344–349, November 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. J. Hu, J. A. Roy, and I. L. Markov, “Sidewinder—a scalable ILP-based router,” in Proceedings of the International Workshop on System Level Interconnect Prediction (SLIP '08), pp. 73–79, ACM, New York, NY, USA, 2008. View at Publisher · View at Google Scholar · View at Scopus
  16. Z. Yang, S. Areibi, and A. Vannelli, “An ILP based hierarchical global routing approach for VLSI ASIC design,” Journal of Optimization Letters, vol. 1, no. 3, pp. 281–297, 2007. View at Publisher · View at Google Scholar · View at Scopus
  17. T.-H. Lee and T.-C. Wang, “Congestion-constrained layer assignment for via minimization in global routing,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 27, no. 9, pp. 1643–1656, 2008. View at Publisher · View at Google Scholar · View at Scopus
  18. R. C. Prim, “Shortest connection networks and some generalization,” Bell System Technical Journal, vol. 36, pp. 1389–1401, 1957. View at Google Scholar
  19. F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem, North-Holland, Amsterdam, The Netherlands, 1992.
  20. M. R. Garey and D. S. Johnson, “The rectilinear steiner tree problem is NP-complete,” SIAM Journal of Applied Mathematics, vol. 32, pp. 826–834, 1977. View at Google Scholar
  21. C. Chu and Y.-C. Wong, “FLUTE: fast lookup table based rectilinear steiner minimal tree algorithm for VLSI design,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 27, no. 1, pp. 70–83, 2008. View at Publisher · View at Google Scholar · View at Scopus
  22. M. Pan and C. Chu, “FastRoute: a step to integrate global routing into placement,” in Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD '06), pp. 464–471, 2006. View at Publisher · View at Google Scholar · View at Scopus
  23. L. McMurchie and C. Ebeling, “Pathfinder: a negotiation-based performance-driven router for FPGAs,” in Proceedings of the International Symposium on Field Programmable Gate Arrays (FPGA '95), pp. 111–117, Monterey, Calif, USA, 1995.
  24. W. A. Dees Jr. and R. J. Smith II, “Performance of interconnection rip-up and reroute strategies,” in Proceedings of the 18th Design Automation Conference (DAC '82), pp. 382–390, IEEE Press, Piscataway, NJ, USA, 1981. View at Scopus
  25. D. Jansen, The Electronic Design Automation Handbook, Springer, New York, NY, USA, 2003.
  26. A. Vannelli, V. H. Quintana, and L. Vargas, “Interior point optimization methods: theory, implementations and engineering applications,” Canadian Journal of Electrical and Computer Engineering, vol. 17, no. 2, pp. 84–94, 1992. View at Google Scholar · View at Scopus
  27. T. Lengauer and M. Lügering, “Provably good global routing of integrated circuits,” SIAM Journal on Optimization, vol. 11, no. 1, pp. 1–30, 2001. View at Publisher · View at Google Scholar · View at Scopus
  28. L. Behjat, A. Vannelli, and W. Rosehart, “Integer linear programming models for global routing,” INFORMS Journal on Computing, vol. 18, no. 2, pp. 137–150, 2006. View at Publisher · View at Google Scholar · View at Scopus
  29. M. Burstein and R. Pelavin, “Hierarchical wire routing,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 2, no. 4, pp. 223–234, 1983. View at Google Scholar · View at Scopus
  30. J. Cong, M. Xie, and Y. Zhang, “An enhanced multilevel routing system,” in Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD '02), pp. 51–53, ACM, New York, NY, USA, 2002. View at Scopus
  31. M. Cho and D. Z. Pan, “BoxRouter: a new global router based on box expansion and progressive ILP,” in Proceedings of the Design Automation Conference (DAC '06), pp. 373–378, ACM, New York, NY, USA, 2006. View at Publisher · View at Google Scholar · View at Scopus
  32. Z. Yang, S. Areibi, and A. Vannelli, “A comparison of ILP based global routing models for VLSI ASIC design,” in Proceedings of the IEEE Midwest Symposium on Circuits and Systems (MWSCAS '07), pp. 1141–1144, 2007. View at Publisher · View at Google Scholar · View at Scopus
  33. D. P. Bertsekas, Nonlinear Programming, Athena Scientific, Belmont, Mass, USA, 1995.
  34. ILOG, “CPLEX: high-performance software for mathematical programming and optimization,” http://www.ilog.com/products/cplex.
  35. “ISPD98 global routing benchmark suite,” http://www.ece.ucsb.edu/~kastner/labyrinth.
  36. R. Kastner, E. Bozorgzadeh, and M. Sarrafzadeh, “Pattern routing: use and theory for increasing predictability and avoiding coupling,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 21, no. 7, pp. 777–790, 2002. View at Publisher · View at Google Scholar · View at Scopus