A Slicing Structure Representation for the Multi-layer Floorplan Layout Problem

  • Johan Berntsson
  • Maolin Tang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3005)


This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floorplanning problem. The original contribution is a three dimensional slicing structure representation which, to the best of our knowledge, is the first 3D floorplan representation in the literature. In this paper we give some background on VLSI design and the floorplanning problem before describing the slicing structure representation and the genetic algorithm extensions. We present results for benchmark problems and obtain improvements on previously published results for single layer floorplanning.


Genetic Algorithm Current Layer VLSI Design Polish Expression Sequential Genetic Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Parkhurst, J., Sherwani, N., Maturi, S., Ahrams, D., Chiprout, E.: SRC Physical Design Top Ten Problems. In: Proceedings of the 1999 international symposium on Physical design, pp. 55–58. ACM Press, New York (1999)CrossRefGoogle Scholar
  2. 2.
    Salewski, S., Barke, E.: An Upper Bound for 3D Slicing Floorplans. In: Proceedings of the Asia South Pacific Design Automation/VLSI Design Conference, pp. 567–572. IEEE Computer Society Press, Los Alamitos (2002)Google Scholar
  3. 3.
    Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to NP Completeness. Freeman, New York (1979)zbMATHGoogle Scholar
  4. 4.
    Sait, S.M., Youssef, H.: VLSI physical design automation: theory and practice. IEEE Press, Los Alamitos (1995)Google Scholar
  5. 5.
    Otten, R.H.J.M.: Automatic Floorplan Design. In: Proceedings of the 19th Design Automation Conference, pp. 261–267 (1982)Google Scholar
  6. 6.
    Chang, Y.C., Chang, Y.W., Wu, G.M., Wu, S.W.: B*-trees: a new representation for non-slicing floorplans. In: Proceedings of the 37th Design Automation Conference, pp. 458–463. ACM Press, New York (2000)Google Scholar
  7. 7.
    Lin, J.M., Chang, Y.W.: TCG: a transitive closure graph-based representation for non-slicing floorplans. In: Proceedings of the 38th conference on Design automation, pp. 764–769. ACM Press, New York (2001)Google Scholar
  8. 8.
    Young, E.F.Y., Chu, C.C.N., Shen, Z.C.: Twin binary sequences: a nonredundant representation for general nonslicing floorplan. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 22, 457–469 (2003)CrossRefGoogle Scholar
  9. 9.
    Lin, C.T., Chen, D.S., Wang, Y.W.: An efficient genetic algorithm for slicing floorplan area optimization. In: Proceedings of the 2002 IEEE International Symposium on Circuits and Systems, vol. 2, pp. 879–882. IEEE Press, Los Alamitos (2002)Google Scholar
  10. 10.
    Young, F.Y., Wong, D.F.: How good are slicing floorplans? In: Proceedings of the 1997 international symposium on Physical design, pp. 144–149. ACM Press, New York (1997)CrossRefGoogle Scholar
  11. 11.
    Young, F.Y., Wong, D.F.: Slicing floorplans with pre-placed modules. In: Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, pp. 252–258. ACM Press, New York (1998)CrossRefGoogle Scholar
  12. 12.
    Tazawa, I., Koakutsu, S., Hirata, H.: An immunity based genetic algorithm and its application to the VLSI floorplan design problem. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 417–421. IEEE Press, Los Alamitos (1996)CrossRefGoogle Scholar
  13. 13.
    Schnecke, V., Vornberger, O.: Genetic design of VLSI-layouts. In: Proceedings of the First International Conference on Genetic Algorithms in Engineering Systems, pp. 430–435 (1995)Google Scholar
  14. 14.
    Esbensen, H., Kuh, E.S.: EXPLORER: an interactive floorplanner for design space exploration. In: Proceedings of the European Design Automation Conference, pp. 356–361 (1996)Google Scholar
  15. 15.
    Cohoon, J.P., Hegde, S.U., Martin, W.N., Richards, D.S.: Distributed genetic algorithms for the floorplan design problem. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 10(4), 483–492 (1991)CrossRefGoogle Scholar
  16. 16.
    Valenzuela, C.L., Wang, P.Y.: VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions. IEEE Transactions on Evolutionary Computation 6(4), 390–401 (2002)CrossRefGoogle Scholar
  17. 17.
    Salewski, S., Olbrich, M., Barke, E.: LIFT: Ein Multi-Layer IC Floorplanning Tool. In: EIS-Workshop, pp. 157–162 (2003)Google Scholar
  18. 18.
    Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Heidelberg (1992)zbMATHGoogle Scholar
  19. 19.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Johan Berntsson
    • 1
  • Maolin Tang
    • 1
  1. 1.School of Computing Science and Software EngineeringQueensland University of TechnologyAustralia

Personalised recommendations