Table of Contents
VLSI Design
Volume 2011, Article ID 892310, 9 pages
http://dx.doi.org/10.1155/2011/892310
Research Article

Efficient Congestion Mitigation Using Congestion-Aware Steiner Trees and Network Coding Topologies

Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX 77843, USA

Received 26 December 2010; Accepted 5 February 2011

Academic Editor: Zhuo Li

Copyright © 2011 M. A. R. Chaudhry 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. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley & Sons, New York, NY, USA, 1990.
  2. N. A. Sherwani, Algorithms for VLSI Physical Design Automation, Kluwer Academic Publishers, Norwell, Mass, USA, 2nd edition, 1995.
  3. R. Ahlswede, N. Cai, S. Y. R. Li, and R. W. Yeung, “Network information flow,” IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204–1216, 2000. View at Publisher · View at Google Scholar · View at Scopus
  4. J. Hu and S. S. Sapatnekar, “A survey on multi-net global routing for integrated circuits,” Integration, the VLSI Journal, vol. 31, no. 1, pp. 1–49, 2001. View at Publisher · View at Google Scholar · View at Scopus
  5. R. Kastner, E. Bozorgzadeh, and M. Sarrafzadeh, “Predictable routing,” in Proceedings of IEEE/ACM International Conference on Computer Aided Design (ICCAD '00), pp. 110–113, 2000. View at Scopus
  6. C. Albrecht, “Provably good global routing by a new approximation algorithm for multicommodity flow,” in Proceedings of the International Symposium on Physical Design (ISPD '00), pp. 19–25, April 2000. View at Scopus
  7. J. Cong, J. Fang, and Y. Zhang, “Multilevel approach to full-chip gridless routing,” in Proceedings of the International Conference on Computer-Aided Design, pp. 396–403, November 2001. View at Scopus
  8. Y. W. Chang and S. P. Lin, “MR: A new framework for multilevel full-chip routing,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 23, no. 5, pp. 793–800, 2004. View at Publisher · View at Google Scholar · View at Scopus
  9. M. Cho and D. Z. Pan, “BoxRouter: a new global router based on box expansion and progressive ILP,” in Proceedings of the ACM/IEEE Design Automation Conference, pp. 373–378. View at Publisher · View at Google Scholar · View at Scopus
  10. M. Cho, K. Lu, K. Yuan, and D. Z. Pan, “BoxRouter 2.0: architecture and implementation of a hybrid and robust global router,” in Proceedings of IEEE/ACM International Conference on Computer-Aided Design (ICCAD '07), pp. 503–508, November 2007. View at Publisher · View at Google Scholar · View at Scopus
  11. M. Pan and C. Chu, “FastRoute 2.0: a high-quality and efficient global router,” in Proceedings of Asia and South Pacific Design Automation Conference (ASP-DAC '07), pp. 250–255, January 2007. View at Publisher · View at Google Scholar · View at Scopus
  12. J. A. Roy and I. L. Markov, “High-performance routing at the nanometer scale,” in Proceedings of IEEE/ACM International Conference on Computer-Aided Design (ICCAD '07), pp. 496–502, November 2007. View at Publisher · View at Google Scholar · View at Scopus
  13. M. D. Moffitt, “MaizeRouter: engineering an effective Global Router,” in Proceedings of Asia and South Pacific Design Automation Conference (ASP-DAC '08), pp. 226–231, March 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, San Francisco, Calif, USA, 1979.
  15. G. Robins and A. Zelikovsky, “Improved Steiner tree approximation in graphs,” in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 770–779, January 2000. View at Scopus
  16. S. Voß, “Steiner's problem in graphs: heuristic methods,” Discrete Applied Mathematics, vol. 40, no. 1, pp. 45–72, 1992. View at Google Scholar · View at Scopus
  17. M. P. D. Aragão and R. F. Werneck, “On the implementation of MST-based heuristics for the steiner problem in graphs,” in Proceedings of the 4th International Workshop on Algorithm Engineering and Experiments, pp. 1–15, 2002.
  18. R. Dechter and J. Pearl, “Generalized best-first search strategies and the optimality of A*,” Journal of the ACM, vol. 32, no. 3, pp. 505–536, 1985. View at Publisher · View at Google Scholar · View at Scopus
  19. S. Y. R. Li, R. W. Yeung, and N. Cai, “Linear network coding,” IEEE Transactions on Information Theory, vol. 49, no. 2, pp. 371–381, 2003. View at Publisher · View at Google Scholar · View at Scopus
  20. R. Koetter and M. Médard, “An algebraic approach to network coding,” IEEE/ACM Transactions on Networking, vol. 11, no. 5, pp. 782–795, 2003. View at Publisher · View at Google Scholar · View at Scopus
  21. T. Ho, R. Koetter, M. Médard, D. R. Karger, and M. Effros, “The benefits of coding over routing in a randomized setting,” in Proceedings of IEEE International Symposium on Information Theory (ISIT '03), p. 442, July 2003. View at Scopus
  22. S. Jaggi, P. Sanders, P. A. Chou et al., “Polynomial time algorithms for multicast network code construction,” IEEE Transactions on Information Theory, vol. 51, no. 6, pp. 1973–1982, 2005. View at Publisher · View at Google Scholar · View at Scopus
  23. N. Jayakumar, S. P. Khatri, K. Gulati, and A. Sprintson, “Network coding for routability improvement in VLSI,” in Proceedings of the International Conference on Computer-Aided Design (ICCAD '06), pp. 820–823, November 2006. View at Publisher · View at Google Scholar · View at Scopus
  24. K. Gulati and S. R. Khatri, “Improving FPGA routability using network coding,” in Proceedings of the 18th ACM Great Lakes Symposium on VLSI (GLSVLSI '08), pp. 147–150, March 2008. View at Publisher · View at Google Scholar · View at Scopus
  25. C. J. Alpert, “ISPD98 circuit benchmark suite,” in Proceedings of the International Symposium on Physical Design (ISPD '98), pp. 80–85, April 1998. View at Scopus
  26. C. Chu, “FLUTE: fast lookup table based wirelength estimation technique,” in Proceedings of IEEE/ACM International Conference on Computer-Aided Design (ICCAD '04), pp. 696–701, November 2004. View at Scopus
  27. M. A. R. Chaudhry, Z. Asad, A. Sprintson, and J. Hu, “Efficient rerouting algorithms for congestion mitigation,” in Proceedings of IEEE Computer Society Annual Symposium on VLSI (ISVLSI '09), pp. 43–48, May 2009. View at Publisher · View at Google Scholar · View at Scopus