Skip to main content

G-NSVF: A Greedy Algorithm for Non-Slicing VLSI Floorplanning

  • Conference paper
  • First Online:
Digital Democracy – IT for Change (CSI 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1372))

Included in the following conference series:

  • 228 Accesses

Abstract

Floorplanning is the first step in the physical design of VLSI. At this stage, the circuit is partitioned into blocks for packing them optimally within the chip. The metrics minimized in floorplan are overall interconnect wirelength, area of the chip, deadspace, etc. B* tree is a popular representation of floorplan as it captures both slicing and non-slicing floorplans. In this work, we have proposed a greedy algorithm for the initial floorplan, which can be used by simulated annealing placer that takes B* tree as the initial floorplan. The proposed algorithm in conjunction with B* tree when integrated into simulated annealing placer and experimented on MCNC benchmarks reduces the overall wirelength on an average by 11% and 69% as compared to random and prior greedy initial floorplans.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Similar content being viewed by others

References

  1. Chang, Y.C., Chang, Y.W., Wu, G.M., Wu, S.W.: B* Tree: a new representation for non slicing floorplans. In: ACM/IEEE Design Automation Conference, pp. 458–463 (2000)

    Google Scholar 

  2. Chen, J., Zhu, W., Ali, M.M.: A Hybrid Simulated Annealing Algorithm for Nonslicing VLSI Floorplanning (2011)

    Google Scholar 

  3. Chan, H.H., Adya, S.N., Markov, I.L.: Are floorplan representations important in digital design?. In: Proceedings of the International Symposium on Physical Design, pp. 168–173 (2000)

    Google Scholar 

  4. Murata, H., Fujiyoshi, K., Nakatake, S., Kajitani, Y.: Rectangle-packing based module placement. In: Proceedings of the ICCAD, pp. 472–479 (1995)

    Google Scholar 

  5. Nakatake, S., Fujiyoshi, K., Murata, H., Kajitani, Y.: Module placement on BSG-structure and IC layout applications. In: Proceedings of the ICCAD, pp. 484–491 (1996)

    Google Scholar 

  6. Guo, P.-N., Cheng, C.-K., Yoshimura, T.: An O-tree representation of non-slicing floorplan and its applications. In: Proceedings of the DAC, pp. 268–273 (1999)

    Google Scholar 

  7. Sechen, C., Sangiovani-Vincentelli, A.L.: The timber wolf placement and routing package. IEEE J. Solid-State Circuits SC-20(2), 510–522 (1985)

    Google Scholar 

  8. Chen, J., Liu, Y., Zhu, Z., Zhu, W.: An adaptive hybrid memetic algorithm for thermal-aware non-slicing VLSI floorplanning. Integr. VLSI J. 58 (2017). https://doi.org/10.1016/j.vlsi.2017.03.006

  9. Chen, J.Z., Ali, W., Montaz, A.: A hybrid simulated annealing algorithm for non slicing VLSI floorplanning. IEEE Trans. Syst. Man Cybern Part C: Appl. Rev. 41, 544–553 (2011). https://doi.org/10.1109/TSMCC.2010.2066560

    Article  Google Scholar 

  10. Sur-Kolay, S.: Studies on nonslicible floorplans in VLSI layout design. Ph.D. dissertation, Department of Computer Science and Engineering, Jadavpur University, Calcutta (1991)

    Google Scholar 

  11. Wong, D.F., Liu, C.L.: Floorplan design for rectangular and L-shaped modules. In: Proceedings of the International Conference on Computer Aided Design, pp. 520–523, November 1987

    Google Scholar 

  12. Chen, T.C., Chang, Y.-W.: Modern floorplanning based on fast simulated annealing, pp. 104–112 (2005). https://doi.org/10.1145/1055137.1055161

  13. The MCNC Benchmark Problems for VLSI Floorplanning. http://www.mcnc.org

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ray, B.N.B., Sahoo, S.S., Mohanty, S.K. (2021). G-NSVF: A Greedy Algorithm for Non-Slicing VLSI Floorplanning. In: Behera, P.K., Sethi, P.C. (eds) Digital Democracy – IT for Change. CSI 2020. Communications in Computer and Information Science, vol 1372. Springer, Singapore. https://doi.org/10.1007/978-981-16-2723-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-2723-1_6

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-2722-4

  • Online ISBN: 978-981-16-2723-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics