Skip to main content

Advertisement

SpringerLink
Log in

DPAHMA: a novel dual-population adaptive hybrid memetic algorithm for non-slicing VLSI floorplans

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Floorplanning is a crucial part of very large-scale integration (VLSI) physical design flow. It primarily determines the position of the blocks on a chip by considering the area, the total wirelength, etc., in light of several real-world limitations such as delay, price, and chip performance. Adopting B*-tree representation, this paper proposes a novel dual-population adaptive hybrid memetic algorithm called DPAHMA to handle the VLSI floorplanning problem effectively by optimizing the chip area and the total wirelength. Three main ideas are presented in this paper, including new definitions of crossover and mutation operators based on B*-tree encoding that overcome the shortcomings of the existing method, such as overly complicated operations on binary trees and a lack of diversity; a dynamic self-adjusting objective function, namely WeightDS, which is able to find solutions more suitable for the user-specified weight; and a main-auxiliary population mechanism by which a candidate population is introduced to assist the normal population in the global search phase. To make full use of the information obtained by the local search method, the candidate population keeps its high-quality solutions. The individuals from the candidate population crossover with the individuals from the normal population before the end of each iteration to obtain higher-quality solutions as much as possible. Experimental results for MCNC and GSRC benchmarks show that DPAHMA obtains floorplans effectively with better area and total wirelength than those of the state-of-the-art floorplanners.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

Data availability

Experimental data and the source code are available upon request from the corresponding author zhangliming_jlu@163.com. For datasets, all MCNC benchmarks can be found in http://vlsicad.eecs.umich.edu/BK/MCNCbench/, and all GSRC benchmarks can be found in http://vlsicad.eecs.umich.edu/BK/GSRCbench/. Moreover, we transform the n100, n200, and n300 benchmarks into YAL format, and they are also available upon request from the corresponding author zhangliming_jlu@163.com.

References

  1. Baker BS, Coffman EG, Rivest RL (1980) Orthogonal packings in two dimensions. SIAM J Comput 9(4):846–855. https://doi.org/10.1137/0209064

    Article  MathSciNet  MATH  Google Scholar 

  2. Chang Y, Chang Y, Wu G, Wu S (2000) B*-trees: a new representation for non-slicing floorplans. In: Micheli GD (ed) Proceedings of the 37th Conference on Design Automation, Los Angeles, CA, USA, June 5-9, 2000, pp 458–463. ACM

  3. Chazelle B (1983) The bottom-left bin-packing heuristic: an efficient implementation. IEEE Trans Comput 32(8):697–707. https://doi.org/10.1109/TC.1983.1676307

    Article  MATH  Google Scholar 

  4. Chen G, Guo W, Chen Y (2010) A pso-based intelligent decision algorithm for VLSI floorplanning. Soft Comput 14(12):1329–1337. https://doi.org/10.1007/s00500-009-0501-6

    Article  Google Scholar 

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

    Article  Google Scholar 

  6. Chen J, Zhu W, Ali MM (2011) A hybrid simulated annealing algorithm for nonslicing VLSI floorplanning. IEEE Trans Syst Man Cybern Part C 41(4):544–553. https://doi.org/10.1109/TSMCC.2010.2066560

    Article  Google Scholar 

  7. Chen T, Chang Y (2006) Modern floorplanning based on b\({}^{\text{* }}\)-tree and fast simulated annealing. IEEE Trans Comput Aid Des Integr Circuits Syst 25(4):637–650. https://doi.org/10.1109/TCAD.2006.870076

    Article  Google Scholar 

  8. Frantz F, Labrak L, O’Connor I (2011) 3D-ic floorplanning: Applying meta-optimization to improve performance. In: IEEE/IFIP 19th International Conference on VLSI and System-on-Chip, VLSI-SoC 2011, Kowloon, Hong Kong, China, October 3-5, 2011, pp 404–409. IEEE

  9. GSRC benchmarks for floorplanning (2007) Available at http://vlsicad.eecs.umich.edu/BK/GSRCbench/

  10. Guo P, Cheng C, Yoshimura T (1999) An o-tree representation of non-slicing floorplan and its applications. In: Irwin MJ (ed) Proceedings of the 36th Conference on Design Automation, New Orleans, LA, USA, June 21–25, 1999, pp 268–273. ACM Press

  11. Healy MB, Vittes M, Ekpanyapong M, Ballapuram CS, Lim SK, Lee HS, Loh GH (2007) Multiobjective microarchitectural floorplanning for 2-d and 3-d ICS. IEEE Trans Comput Aid Des Integr Circuits Syst 26(1):38–52. https://doi.org/10.1109/TCAD.2006.883925

    Article  Google Scholar 

  12. Hong X, Huang G, Cai Y, Gu J, Dong S, Cheng C, Gu J (2000) Corner block list: an effective and efficient topological representation of non-slicing floorplan. In: Sentovich E (ed) Proceedings of the 2000 IEEE/ACM International Conference on Computer-Aided Design, 2000, San Jose, California, USA, November 5–9, 2000, pp 8–12. IEEE Computer Society

  13. Huang W, Chen D, Xu R (2007) A new heuristic algorithm for rectangle packing. Comput Oper Res 34(11):3270–3280. https://doi.org/10.1016/j.cor.2005.12.005

    Article  MathSciNet  MATH  Google Scholar 

  14. IBM SPSS software for statistical analysis (2020) Available at https://www.ibm.com/analytics/spss-statistics-software/

  15. Ku BW, Liu Y, Jin Y, Samal SK, Li P, Lim SK (2018) Design and architectural co-optimization of monolithic 3d liquid state machine-based neuromorphic processor. In: Proceedings of the 55th Annual Design Automation Conference, DAC 2018, San Francisco, CA, USA, June 24–29, 2018, pp 165:1–165:6. ACM

  16. Lesh N, Marks J, McMahon A, Mitzenmacher M (2005) New heuristic and interactive approaches to 2d rectangular strip packing. ACM J Exp Algorithmics 10(1145/1064546):1083322

    MathSciNet  MATH  Google Scholar 

  17. Lin J, Chang Y (2001) TCG: a transitive closure graph-based representation for non-slicing floorplans. In: Proceedings of the 38th Design Automation Conference, DAC 2001, Las Vegas, NV, USA, June 18–22, 2001, pp 764–769. ACM

  18. Lin J, Chen T, Hsieh H, Shyu Y, Chang Y, Lu J (2021) Thermal-aware fixed-outline floorplanning using analytical models with thermal-force modulation. IEEE Trans Very Large Scale Integr Syst 29(5):985–997. https://doi.org/10.1109/TVLSI.2021.3062669

    Article  Google Scholar 

  19. MCNC benchmarks for floorplanning (2007) Available at http://vlsicad.eecs.umich.edu/BK/MCNCbench/

  20. Moore GE (1998) Cramming more components onto integrated circuits. Proc IEEE 86(1):82–85. https://doi.org/10.1109/jproc.1998.658762

    Article  Google Scholar 

  21. Murata H, Fujiyoshi K, Nakatake S, Kajitani Y (1996) VLSI module placement based on rectangle-packing by the sequence-pair. IEEE Trans Comput Aid Des Integr Circuits Syst 15(12):1518–1524. https://doi.org/10.1109/43.552084

    Article  Google Scholar 

  22. Nakatake S, Fujiyoshi K, Murata H, Kajitani Y (1996) Module placement on BSG-structure and IC layout applications. In: Rutenbar RA, Otten RHJM (eds) Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1996, San Jose, CA, USA, November 10–14, 1996, pp 484–491. IEEE Computer Society/ACM

  23. Singh R, Baghel A, Agarwal A (2016) A review on VLSI floorplanning optimization using metaheuristic algorithms. In: 2016 International Conference on Electrical, Electronics, and Optimization Techniques, pp 4198–4202

  24. Sivaranjani P, Kumar AS (2015) Thermal-aware non-slicing VLSI floorplanning using a smart decision-making PSO-GA based hybrid algorithm. Circuits Syst Signal Process 34(11):3521–3542. https://doi.org/10.1007/s00034-015-0020-x

    Article  Google Scholar 

  25. Sivaranjani P, Kumar AS (2017) Hybrid particle swarm optimization-firefly algorithm (HPSOFF) for combinatorial optimization of non-slicing VLSI floorplanning. J. Intell Fuzzy Syst 32(1):661–669. https://doi.org/10.3233/JIFS-152551

    Article  Google Scholar 

  26. Srinivasan B, Venkatesan R (2021) Multi-objective optimization for energy and heat-aware VLSI floorplanning using enhanced firefly optimization. Soft Comput 25(5):4159–4174. https://doi.org/10.1007/s00500-021-05591-x

    Article  Google Scholar 

  27. Sun F, Chang Y (2019) Big: a bivariate gradient-based wirelength model for analytical circuit placement. In: Proceedings of the 56th Annual Design Automation Conference 2019, DAC 2019, Las Vegas, NV, USA, June 02–06, 2019, p 118. ACM

  28. Sutanthavibul S, Shragowitz E, Rosen JB (1991) An analytical approach to floorplan design and optimization. IEEE Trans Comput Aid Des Integr Circuits Syst 10(6):761–769. https://doi.org/10.1109/43.137505

    Article  Google Scholar 

  29. Tang M, Yao X (2007) A memetic algorithm for VLSI floorplanning. IEEE Trans Syst Man Cybern Part B 37(1):62–69. https://doi.org/10.1109/TSMCB.2006.883268

    Article  Google Scholar 

  30. Wong DF, Liu CL (1986) A new algorithm for floorplan design. In: Thomas D (ed) Proceedings of the 23rd ACM/IEEE Design Automation Conference. Las Vegas, NV, USA, June, 1986, pp 101–107. IEEE Computer Society Press

  31. Xu Q, Chen S, Li B (2016) Combining the ant system algorithm and simulated annealing for 3d/2d fixed-outline floorplanning. Appl Soft Comput 40:150–160. https://doi.org/10.1016/j.asoc.2015.10.045

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (NSFC) under Grant Nos. 62076108, 61872159 and 61672261, the education department of Jilin Province (JJKH20211106KJ, JJKH20211103KJ). The authors would like to thank Jianli Chen from Fuzhou University for providing the source code of AHMA and Qi Xu from University of Science and Technology of China for his valuable advice. Special thanks to Prof. Yaowen Chang from National University of Taiwan for the B*-tree package.

Funding

This work was supported by the National Natural Science Foundation of China (NSFC) under Grant Nos. 62076108, 61872159 and 61672261.

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Jilin University, Changchun, 130012, China

    Luyu Jiang, Dantong Ouyang, Huisi Zhou, Naiyu Tian & Liming Zhang

  2. Key Laboratory of Symbolic Computation and Knowledge Engineering, Ministry of Education, Jilin University, Changchun, 130012, China

    Luyu Jiang, Dantong Ouyang, Huisi Zhou, Naiyu Tian & Liming Zhang

Authors
  1. Luyu Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dantong Ouyang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Huisi Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Naiyu Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Liming Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

LJ contributes mostly on the ideas and the implementations and writes the paper, while DO and LZ contribute mostly on improvments of the writing quality and help correct the faultiness of this manuscript. HZ and NT contribute on recording the experimental data and collecting other information such as the figures of floorplanning.

Corresponding author

Correspondence to Liming Zhang.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict of interests regarding the publication of this paper.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jiang, L., Ouyang, D., Zhou, H. et al. DPAHMA: a novel dual-population adaptive hybrid memetic algorithm for non-slicing VLSI floorplans. J Supercomput 79, 15496–15534 (2023). https://doi.org/10.1007/s11227-023-05277-1

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-023-05277-1

Keywords

Search

Navigation