An Efficient Parallel Computing Framework for Over the Obstacle VLSI Routing

  • G. ShyamalaEmail author
  • G. R. Prasad
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1119)


Constructing a fast and efficient rectilinear Steiner minimal tree (RSMT) in the presence of obstacle/blockage is a major issue in VLSI physical design (PD). The existing method considers maze routing method for addressing obstacle-avoiding RSMT (OARSMT) problem. However, using OARSMT can induce longer wire length (WL) and routing delay. Further, in existing model, only slew constraint is considered and delay constraint are neglected. This results in wastage of routing resources (i.e. due to higher buffer size). For overcoming these problems, this work presents an efficient routing over obstacle-based RSMT construction that satisfies delay requirement. Further, we present an efficient parallel computing architecture to enhance RSMT construction (i.e. in parallel manner) under multicore environment (i.e. CPU and GPU). Experiments are conducted on small to large nets with blockages. The outcome achieved in the proposed routing method is to reduce wire length and attain better speedup when compared with sequential and existing VLSI routing model.


Graphical processing unit Multicore environment Parallel computing framework RSMT VLSI 


  1. 1.
    Chang, C.-Y., Tseng, I.-L.: A parallel algorithm for constructing obstacle-avoiding rectilinear Steiner minimal trees on multi-core systems. (2012)Google Scholar
  2. 2.
    Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4), 826–834 (1977)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Ajwani, G., Chu, C., Mak, W.-K.: FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction. In: Proceedings of the ISPD (2010)Google Scholar
  4. 4.
    Huang, T., Young, E.F.Y.: An exact algorithm for the construction of rectilinear Steiner minimum trees among complex obstacles. In: Proceedings of the DAC (2011)Google Scholar
  5. 5.
    Li, L., Qian, Z., Young, E.F.Y.: Generation of optimalobstacle-avoiding rectilinear Steiner minimum tree. In: Proceedings of the ICCAD (2009)Google Scholar
  6. 6.
    Li, L., Young, E.F.Y.: Obstacle-avoiding rectilinear Steiner Tree construction. In: Proceedings of the ICCAD (2008)Google Scholar
  7. 7.
    Huang, T., Li, L., Young, E.F.Y.: On the construction of optimal obstacle-avoiding rectilinear Steiner minimum trees. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 30(5), 718–731 (2011)Google Scholar
  8. 8.
    Liu, C.H., Kuo, S.Y., Lee, D.T., Lin, C.S., Weng, J.H., Yuan, S.Y.: Obstacle-avoiding rectilinear steiner tree construction: a steiner-point-based algorithm. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 31(7), 1050–1060 (2012)CrossRefGoogle Scholar
  9. 9.
    Hu, S., Alpert, C.J., Hu, J., Karandikar, S., Li, Z., Shi, W., Sze, C.N.: Fast algorithm for slew constrained minimum cost buffering. In: Proceedings of the Design Automation Conference, pp. 308–313 (2006)Google Scholar
  10. 10.
    Lin, Y.-H., Chang, S.-H., Li, Y.-L.: Critical-trunk-based obstacle-avoiding rectilinear Steiner tree routings and buffer insertion for delay and slack optimization. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 30(9), 1335–1348 (2011)CrossRefGoogle Scholar
  11. 11.
    Zhang, H., Ye, D.Y.: Key-node-based local search discrete artificial bee colony algorithm for obstacle-avoiding rectilinear Steiner tree construction. Neural Comput. Appl. 26(4), 875–898 (2015)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Shyamala, G., Prasad, G.R.: Obstacle aware delay optimized rectilinear steiner minimum tree routing. In: 2017 2nd IEEE International Conference on Recent Trends in Electronics, Information and Communication Technology (RTEICT), pp. 2194–2197, Bangalore (2017)Google Scholar
  13. 13.
    Wang, R.-Y., Pai, C.-C., Wang, J.-J., Wen, H.-T., Pai, Y.-C., Chang, Y.-W., Li, J., Jiang, J.-H.: Efficient multi-layer obstacle-avoiding region-to-region rectilinear steiner tree construction. pp. 1–6 (2018)Google Scholar
  14. 14.
    Zhang, H., Ye. D.-y., Guo, W.-z.: A heuristic for constructing a rectilinear Steiner tree by reusing routing resources over obstacles. Integr. VLSI J. (2016)Google Scholar
  15. 15.
    Kashyap, C.V., Alpert, C.J., Liu, F., et al.: PERI: a technique for extending delay and slew metrics to ramp inputs. In: Proceedings of the 8th ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, ACM, pp. 57–62 (2002)Google Scholar
  16. 16.
    Shyamala, G., Prasad, GR.: A study on obstacle avoiding rectilinear steiner tree algorithms. Int. J. Innov. Eng. Technol. 4, 120–130 (2014)Google Scholar
  17. 17.
    Chow, W.-K., Li, L., Young, E.F., Sham, C.-W.: Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach. Integr. VLSI J. 47, 105–114 (2014).
  18. 18.
    Panda, SK., Panda, DC.: Developing high-performance AVM based VLSI computing systems: a study. In: Pattnaik, P., Rautaray, S., Das, H., Nayak J. (eds.) Progress in computing, analytics and networking. Advances in intelligent systems and computing, vol 710. Springer, Singapore (2018)Google Scholar
  19. 19.
    Feng, Z., Li, P.: Multigrid on GPU: tackling power grid analysis on parallel SIMT platforms. In: Proceedings of ICCAD, pp. 647–654 (2008)Google Scholar
  20. 20.
    Han, Y., Roy, S., Chakraborty, K.: Optimizing simulated annealing on GPU: a case study with ic floor planning. In: Proceedings of International Symposium on Quality Electronic Design (ISQED), pp. 1–7 (2011)Google Scholar
  21. 21.
    Deng, Y.: Gpu accelerated VLSI design verification. In: Proceedings of International Conference on Computer and Information Technology (CIT), pp. 1213–1218 (2010)Google Scholar
  22. 22.
    Bader, D., Kanade, V., Madduri, K.: SWARM: a parallel programming framework for multicore processors. In: Parallel and Distributed Processing Symposium, 2007 (IPDPS 2007), pp. 1–8 (2007)Google Scholar
  23. 23.
    Cai, Y., Deng, C., Zhou, Q., Yao, H., Niu, F., Sze, C.N.: Obstacle-avoiding and slew-constrained clock tree synthesis with efficient buffer insertion. In: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 23, no. 1, pp. 142–155 (2015)Google Scholar
  24. 24.
    Liu, C.H., Lin, C.X., Chen, I.C., Lee, D.T., Wang, T.C.: Efficient multilayer obstacle-avoiding rectilinear Steiner tree construction based on geometric reduction. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 33(12), 1928–1941 (2014)CrossRefGoogle Scholar
  25. 25.
    Held, S., Spirkl, S.T.: A fast algorithm for rectilinear Steiner trees with length restrictions on obstacles. In: Proceedings of the 2014 on International Symposium on Physical Design. ACM, 37–44 (2014)Google Scholar
  26. 26.
    Huang, T., Young, E.F.Y.: Construction of rectilinear Steiner minimum trees with slew constraints over obstacles. In: Proceedings of the International Conference on Computer-Aided Design, ACM, pp. 144–151 (2012)Google Scholar
  27. 27.
    Song, J., Li, Q., Ma, S.: Towards bounds on parallel execution times of task graphs on multicores with memory constraints. IEEE Access 7 (2019)Google Scholar
  28. 28.
    Wang, M., Li, Z.: A spatial and temporal locality-aware adaptive cache design with network optimization for tiled many-core architectures. In: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 25, no. 9, pp. 2419–2433 (2017)Google Scholar
  29. 29.
    He, S., Wang, Y., Sun, X., Xu, C.: Using minmax-memory claims to improve in-memory workflow computations in the cloud. In: IEEE Transactions on Parallel and Distributed Systems, vol. 28, no. 4, pp. 1202–1214 (2017)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Department of CSEBMSCEBangaloreIndia

Personalised recommendations