[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Congestion Balancing Global Router

  • Conference paper
VLSI Design and Test

Abstract

A novel algorithmic approach for a global routing solution for VLSI circuits is proposed in this paper. Instead of following the traditional Steiner tree approach towards global routing, we have used a congestion sensing path laying approach. We introduce the concept of detouring of net segments running through heavily congested edges. The technique brings down the congestion of edges, to meet the constraints of edge capacity, by detouring the net segments through sparsely populated edges. Our approach has been implemented and tested on the ISPD 98 benchmark circuits and has achieved results comparable to other global routers when congestion minimization and wire length minimization are taken into consideration.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ispd 1998 benchmark suite (1998), http://cseweb.ucsd.edu/~kastner/research/labyrinth/

  2. Ispd 2007 benchmark suite (2007), http://archive.sigda.org/ispd2007/

  3. Ispd 2008 benchmark suite (2008), http://archive.sigda.org/ispd2008/

  4. Lee, C.Y.: An algorithm for path connections and its applications. IRE Transactions on Electronic Computers EC-10(3), 346–365 (1961)

    Article  Google Scholar 

  5. Alpert, C.J., Hrkić, M., Hu, J., Kahng, A.B., Lillis, J., Liu, B., Quay, S.T., Sapatnekar, S.S., Sullivan, A.J., Villarrubia, P.: Buffered steiner trees for difficult instances. In: Proceedings of the 2001 International Symposium on Physical Design, ISPD 2001, pp. 4–9. ACM, New York (2001)

    Chapter  Google Scholar 

  6. Chiang, C., Wong, C., Sarrafzadeh, M.: A weighted steiner tree-based global router with simultaneous length and density minimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 13(12), 1461–1469 (1994)

    Article  Google Scholar 

  7. Areibi, S., Xie, M., Vannelli, A.: An efficient rectilinear steiner tree algorithm for vlsi global routing. In: Canadian Conference on Electrical and Computer Engineering, vol. 2, pp. 1067–1072 (2001)

    Google Scholar 

  8. Cong, J., Kahng, A., Leung, K.S.: Efficient algorithms for the minimum shortest path steiner arborescence problem with applications to vlsi physical design. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 17(1), 24–39 (1998)

    Article  Google Scholar 

  9. Cong, J., Madden, P.: Performance-driven routing with multiple sources. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 16(4), 410–419 (1997)

    Article  Google Scholar 

  10. Hu, J., Sapatnekar, S.: A timing-constrained simultaneous global routing algorithm. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 21(9), 1025–1036 (2002)

    Article  Google Scholar 

  11. Kastner, R., Bozorgzadeh, E., Sarrafzadeh, M.: An exact algorithm for coupling-free routing (2001)

    Google Scholar 

  12. Sherwani, N.A.: Algorithms for VLSI Physical Design Automation. Kluwer Academic Publishers, Netherlands (1999)

    MATH  Google Scholar 

  13. Chang, Y.J., Lee, Y.T., Wang, T.C.: Nthu-route 2.0: A fast and stable global router. In: IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2008, pp. 338–343 (November 2008)

    Google Scholar 

  14. Hsu, C.H., Chen, H.Y., Chang, Y.W.: Multilayer global routing with via and wire capacity considerations. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 29(5), 685–696 (2010)

    Article  Google Scholar 

  15. Ozdal, M., Wong, M.: Archer: A history-based global routing algorithm. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 28(4), 528–540 (2009)

    Article  Google Scholar 

  16. Roy, J., Markov, I.: High-performance routing at the nanometer scale. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27(6), 1066–1077 (2008)

    Article  Google Scholar 

  17. McMurchie, L.E., Ebeling, C.: Pathfinder: A negotiation-based path-driven router for fpgas. In: Proceeding of the International Symposium on FPGAs. ACM/IEEE (February 1995)

    Google Scholar 

  18. Xu, Y., Zhang, Y., Chu, C.: Fastroute 4.0: Global router with efficient via minimization. In: Asia and South Pacific Design Automation Conference, ASP-DAC 2009, pp. 576–581 (January 2009)

    Google Scholar 

  19. Cao, Z., Jing, T., Xiong, J., Hu, Y., He, L., Hong, X.: Dprouter: A fast and accurate dynamic-pattern-based global routing algorithm. In: Asia and South Pacific Design Automation Conference, ASP-DAC 2007, pp. 256–261 (January 2007)

    Google Scholar 

  20. Moffitt, M.: Maizerouter: Engineering an effective global router. In: Asia and South Pacific Design Automation Conference, ASPDAC 2008, pp. 226–231 (March 2008)

    Google Scholar 

  21. Behjat, L., Vannelli, A., Rosehart, W.: Integer linear programming models for global routing. INFORMS Journal on Computing 18(2), 137–150 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  22. Hu, J., Roy, J.A., Markov, I.L.: Sidewinder: A scalable ilp-based router. In: Proceedings of the 2008 International Workshop on System Level Interconnect Prediction, pp. 73–80. ACM (2008)

    Google Scholar 

  23. Cho, M., Lu, K., Yuan, K., Pan, D.Z.: Boxrouter 2.0: A hybrid and robust global router with layer assignment for routability. ACM Trans. Des. Autom. Electron. Syst. 14(2), 1–32 (2009)

    Article  Google Scholar 

  24. Wu, T.H., Davoodi, A., Linderoth, J.: Grip: Global routing via integer programming. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 30(1), 72–84 (2011)

    Article  Google Scholar 

  25. Muller, D.: Optimizing yield in global routing. In: IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2006, pp. 480–486 (November 2006)

    Google Scholar 

  26. Wu, T.H., Davoodi, A., Linderoth, J.T.: A parallel integer programming approach to global routing. In: 2010 47th ACM/IEEE Design Automation Conference (DAC), pp. 194–199 (June 2010)

    Google Scholar 

  27. Shojaei, H., Davoodi, A., Basten, T.: Collaborative multiobjective global routing. IEEE Transactions on Very Large Scale Integration (VLSI) Systems PP(99), 1

    Google Scholar 

  28. Chu, C., Wong, Y.C.: Flute: Fast lookup table based rectilinear steiner minimal tree algorithm for vlsi design. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27(1), 70–83 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mukherjee, S., Patra, J., Roy, S. (2013). Congestion Balancing Global Router. In: Gaur, M.S., Zwolinski, M., Laxmi, V., Boolchandani, D., Sing, V., Sing, A.D. (eds) VLSI Design and Test. Communications in Computer and Information Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-42024-5_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-42024-5_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-42023-8

  • Online ISBN: 978-3-642-42024-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics