Skip to main content

A Genetic Algorithm for VLSI Floorplanning

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1917))

Abstract

We present a genetic algorithm (GA) which uses a normalized postfix encoding scheme to solve the VLSI floorplanning problem. We claim to have overcome the representational problems previously associated with encoding postfix expressions into GAs, and have developed a novel encoding system which preserves the integrity of solutions under all the genetic operators. Optimal floorplans are obtained for module sets taken from some MCNC benchmarks. The slicing tree construction process, used by our GA to generate the floorplans, has a run time scaling which compares very favourably with other recent approaches.

This work was partially supported by NASA grant NAG-5-4868.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.J. Cavicchio. Adaptive search using simulated evolution. Unpublished doctorial dissertation, University of Michigan, Ann Arbor, 1970.

    Google Scholar 

  2. J.P. Cohoon, S.U. Hedge, W.N. Martin and D.S. Richards. Distributed Genetic Algorithms for the Floorplan Design Problem, IEEE Transactions on Computer Aided Design, Vol. 10, No. 4, pages. 483–492, April 1991.

    Article  Google Scholar 

  3. J.H. Holland. Adaptation in natural and artificial systems. Ann Arbor: The University of Michigan Press, 1975.

    Google Scholar 

  4. H. Murata and Ernest S. Kuh. Sequence-pair based placement method for hard/soft/pre-placed modules, International Symposium on Physical Design, pages 167–172, 1998.

    Google Scholar 

  5. S. Nakatake, H. Murata, K. Fujiyoushi and Y. Kajitani. Rectangle-packing-based module placement, Proceedings IEEE International Conference on Computer-Aided Design, pages 143–145, 1995.

    Google Scholar 

  6. S. Nakatake, K. Fujiyoshi, H. Murata and Y. Kajitani. Module Placement on BSG-Structure and IC Layout Applications, Proceedings IEEE International Conference on Computer-Aided Design, pages 484–491, 1996.

    Google Scholar 

  7. I.M. Oliver, D.J. Smith, and J.R.C. Holland. A study of permutation crossover operators on the traveling salesman problem. Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, pages 224–230, 1987.

    Google Scholar 

  8. V. Schnecke. and O. Vornberger. Genetic Design of VLSI-Layouts, The First International Conference in Genetic ALgorithms in Engineering Systems: Innovations and Applications (GALESIA), IEE, pages 430–435, 1995.

    Google Scholar 

  9. L. Stockmeyer. Optimal Orientations of Cells in Slicing Floorplan Design, Information and Control, Vol. 59, pages 91–101, 1983.

    Article  Google Scholar 

  10. G. Syswerda. Uniform Crossover in Genetic Algorithms, Proceedings of the Third International Conference on Genetic Algorithms. Hillsdale, NJ: Lawrence Erlbaum Associates, 1989.

    Google Scholar 

  11. Christine L. Valenzuela and Pearl Y. Wang. VLSI Placement and Area Optimization Using a Genetic Algorithm to Breed Normalized Postfix Strings. (Manuscript submitted for publication).

    Google Scholar 

  12. D.F. Wong and H.W. Leong and C.L. Liu. Simulated Annealing for VLSI Design, Kluwer Academic Publishers, Norwell, Massachusetts”, 1988.

    MATH  Google Scholar 

  13. F.Y. Young and D.F. Wong. How Good are Slicing Floorplans, The VLSI Journal, Vol. 23, pages 61–73, 1997.

    Article  MATH  Google Scholar 

  14. F.Y. Young and D.F. Wong. Slicing floorplans with pre-placed modules. Proceedings IEEE International Conference on Computer-aided Design, pages 252–258, 1998.

    Google Scholar 

  15. F.Y. Young and D.F. Wong. Slicing floorplans with boundary constraints. IEEE Asia South Pacific Design Automation, pages 17–20, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Valenzuela, C.L., Wang, P.Y. (2000). A Genetic Algorithm for VLSI Floorplanning. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_66

Download citation

  • DOI: https://doi.org/10.1007/3-540-45356-3_66

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41056-0

  • Online ISBN: 978-3-540-45356-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics