Abstract
Global Routing (GR) is a critical step in the VLSI design process. With the ever increasing number of components on a single chip, there is great need of better routing algorithms to produce efficient, congestion free routing. We propose a hybrid Biogeography-based Optimization (BBO)/Maze Routing (MR) algorithm which focuses on producing zero overflow routing solutions. MR is used to generate initial routing of all nets and then a novel BBO based routing algorithm is used to iteratively perform the Rip-up and Reroute (R&R) of congested nets. Lower and upper bounds on the 3D wirelength were computed using the 2-D routing solution generated by the proposed algorithm. The performance of the proposed router was evaluated on ISPD 2007 benchmarks and the results were found to be comparable with some of the state-of-the-art academic global routers and considerably less total overflow was achieved.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Moffitt, M.D.: MaizeRouter: engineering an effective global router. In: Proceedings of Asia and South Pacific Design Automation Conference (2008)
Gao, J.-R., Wu, P.-C., Wang, T.-C.: A new global router for modern designs. In: Proceedings of ACM/IEEE Asia and South Pacific Design Automation Conference, pp. 232–237 (2008)
Sait, S.M., Siddiqi, U.F.: A stochastic evolution algorithm based 2D VLSI global router. Integr. VLSI J. 115–125 (2016)
Ozdal, M.M., Wong, M.D.F.: ARCHER: a history-driven global routing algorithm. In: Proceedings of International Conference on Computer- Aided Design, pp. 481–487 (2007)
Pan, M., Chu, C.: FastRoute 2.0: a high-quality and efficient global router. In: Proceedings of Asia South Pacific Design Automation Conference, pp. 250–255 (2007)
Hu, J., Roy, J.A., Markov, I.L.: Sidewinder: a scalable ILP-based router. In: Proceedings of the ACM International Workshop System Level Interconnect Prediction, pp. 73–80 (2008)
Wu, T.-H., Davoodi, A., Linderoth, J.T.: GRIP: scalable 3D global routing using integer programming. In: Proceedings of Design Automation Conference, pp. 320–325 (2009)
Sherwani, N.: Handbook for VLSI Design Automation, pp. 247–290. Kluwer Publishers, Dordrecht (2003)
Cho, M., Lu, K., Yuan, K., Pan, D.Z.: BoxRouter 2.0: architecture and implementation of a hybrid and robust global router. In: Proceedings of International Conference on Computer-Aided Design, pp. 503–508 (2007)
Lee, T.-H., Wang, T.-C.: Congestion-constrained layer assignment for via minimization in global routing. IEEE Trans. Comput. Aided Design Integr. Circuits Syst. 27(9), 1643–1648 (2008)
Roy, J.A., Markov, I.L.: FGR: a fairly good router (2014). http://vlsicad.eecs.umich.edu/BK/FGR/. Accessed 24 Nov 2016
Chu, C.: FLUTE: fast lookup table based wirelength estimation technique. In: Proceedings of International Conference on Computer-Aided Design, pp. 696–701 (2004)
Simon, D.: Evolutionary Optimization Algorithm, pp. 351–376. Wiley, Hoboken (2013)
Simon, D.: Biogeography-based optimization. IEEE Trans. Evol. Comput. 12(6) (2008)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill, New York (2001)
Albrecht, C.: Global routing by new approximation algorithms for multicommodity flow. IEEE Trans. Comput. Aided Integr. Circuits Syst. 20(5), 622–632 (2001)
Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3), 316–329 (1998)
Behjat, L., Vannelli, A., Rosehart, W.: Integer linear programming models for global routing. INFORMS J. Comput. 18(2), 137–150 (2006)
Burstein, M., Pelavin, R.: Hierarchical wire routing. IEEE Trans. Comput. Aided Design Integr. Circuits Syst. 2(4), 223–234 (1983)
Ma, H.: An analysis of the equilibrium of migration models for biogeography-based optimization. Inf. Sci. 180(18), 3444–3464 (2010)
Shin, H., Sangiovanni-Vincentelli, A.: Mighty: a rip-up and reroute detailed router. In: Proceedings of the International Conference on Computer Aided Design, pp. 115–122 (1986)
Fu, Z., Yu, W., Ma, J., Cheng, X.: An efficient maze routing algorithm for fast global routing. In: Proceedings of the Great Lakes Symposium on VLSI 2022 (GLSVLSI 2022), pp. 169–172. Association for Computing Machinery, New York (2022). https://doi.org/10.1145/3526241.3530360
K.H. Chang, Pan, H.H., Wang, T.C., Chen, P.Y., Shen, C.F.C.: On predicting solution quality of maze routing using convolutional neural network. In: 2022 23rd International Symposium on Quality Electronic Design (ISQED), Santa Clara, CA, USA, pp. 1–6 (2022). https://doi.org/10.1109/ISQED54688.2022.9806227
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Goel, L. (2025). A Novel Architectural Framework for 2-D Global Routing Using Hybrid Biogeography-Based Optimization and Maze Routing Algorithm. In: Hassanien, A.E., Rizk, R.Y., Darwish, A., Alshurideh, M.T.R., Snášel, V., Tolba, M.F. (eds) Proceedings of the 11th International Conference on Advanced Intelligent Systems and Informatics (AISI 2025). AISI 2025. Lecture Notes on Data Engineering and Communications Technologies, vol 238. Springer, Cham. https://doi.org/10.1007/978-3-031-81308-5_43
Download citation
DOI: https://doi.org/10.1007/978-3-031-81308-5_43
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-81307-8
Online ISBN: 978-3-031-81308-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)