Skip to main content

A Discrete PSO for Multi-objective Optimization in VLSI Floorplanning

  • Conference paper
Book cover Advances in Computation and Intelligence (ISICA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5821))

Included in the following conference series:

Abstract

Floorplanning is a critical step in the physical design of Very Large Scale Integrated (VLSI) circuits. Its main target is optimizing the layout area and interconnection wire length of chips, which can be transformed into a Multi-objective Optimization Problem (MOP). In this paper, we propose a discrete Particle Swarm Optimization (PSO) algorithm for MOP which could take many key objectives into consideration and give a good compromise between them. The experiments on MCNC benchmarks show that the proposed algorithm is effective, and gives out many optional results for user’s choice according to partialness, which can not be finished by traditional methods.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kang, L., Juebang, Y., Yongbing, Y.: Configuration of floorplan and placement algorithm using horizontal and vertical contour based on single sequence. In: International conference on Communications, Circuits and Systems, pp. 1171–1174 (2008)

    Google Scholar 

  2. Gwee, B.H., Lim, M.H.: A GA with heuristic based decode for IC floorplanning. Integration, the VLSI Journal 28(2), 157–172 (1999)

    Article  Google Scholar 

  3. Fernando, P., Katkoori, S.: An Elitist Non-Dominated Sorting Based Genetic Algorithm for Simultaneous Area and Wirelength Minimization in VLSI Floorplanning. In: 21st International Conference on VLSI Design, pp. 337–342 (2008)

    Google Scholar 

  4. Guo, P.N., Cheng, C.K., Yoshimura, T.: An O-tree representation of non-slicing floorplan and its applications. In: Proceedings of the 36th ACM/IEEE conference on Design automation conference, New Orleans, Louisiana, United States, pp. 268–273 (1999)

    Google Scholar 

  5. Lin, J.M., Chang, Y.W.: TCG:A transitive closure gragh-based representation for non-slicing floorplans. In: Proc. DAC, pp. 764–769 (2001)

    Google Scholar 

  6. Pang, Y., Cheng, C.K., Yoshimura, T.: An enhanced perturbing algorithm for floorplan design using the O-tree representation. In: The Proceedings of ACM International Physical Design Symposia, pp. 168–173 (2000)

    Google Scholar 

  7. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE Int. Conf. Neural Networks, vol. 4, pp. 1942–1948 (1995)

    Google Scholar 

  8. Coello, C.A.C., Pulido, G.T., Lechuga, M.S.: Handling Multiple Objectives With Particle Swarm Optimization. IEEE Trans. on Evol. Comput. 8, 256–279 (2004)

    Article  Google Scholar 

  9. Garey, M.R., Johnson, D.S.: Computers and Intractability, San Francisco (1979)

    Google Scholar 

  10. Minyou, C., Chuansheng, W., Peter, F.: An evolutionary particle swarm algorithm for multi-objective optimisation. In: Proceedings of 7th World congress on Intellgent Control and Automation, pp. 3269–3274 (2008)

    Google Scholar 

  11. Wenzhong, G., Guolong, C., Min, H., Shuili, C.: A discrete particle swarm optimization algorithm for the multiobjective permutation flowshop sequencing problem. In: Proceedings of the second international conference of Fuzzy Information and Engineering, pp. 323–331 (2007)

    Google Scholar 

  12. Ratnaweera, A., Halgamuge, S.K.: Self-Organizing Hierarchical Particle Swarm Optimizer With Time-Varying Acceleration Coefficients. IEEE Transactions on Evolutionary Computation 8(3), 240–255 (2004)

    Article  Google Scholar 

  13. Hong, X., Huang, G., Cai, Y., Gu, J., Dong, S., Cheng, C.K., Gu, J.: Corner Block List:An effective and efficient topological representation of non-slicing floorplan. In: Proc. ICCAD, pp. 8–12 (2000)

    Google Scholar 

  14. Murata, H., Fujiyoshi, K., Nakatake, S., Kajitani, Y.: VLSI Module Placement Based on Rectangle-Packing by the Sequence-Pair. IEEE Trans. on CAD 15(12), 1518–1524 (1996)

    Article  Google Scholar 

  15. Nakatake, S., Fujiyoshi, K., Murata, H., Kajitani, Y.: Module Packing Based on the BSG-Structure and IC Layout Applications. IEEE Trans. on CAD 17(6), 519–530 (1998)

    Article  Google Scholar 

  16. Wang, X.G., Yao, L.S., Gan, J.R.: VLSI Floorplanning Method Based on Genetic Algorithms. Chinese Journal of Semiconductors 23(3), 330–335 (2002)

    Google Scholar 

  17. Chaomin, L., Anjos, M.F., Vannelli, A.: A nonlinear optimization methodology for VLSI fixed-outline floorplannin. J. Comb. Optim. 16, 378–401 (2008)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, J., Chen, G., Guo, W. (2009). A Discrete PSO for Multi-objective Optimization in VLSI Floorplanning. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2009. Lecture Notes in Computer Science, vol 5821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04843-2_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04843-2_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04842-5

  • Online ISBN: 978-3-642-04843-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics