A genetic algorithm for vlsi floorplanning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1917, Issue , 2000, Pages 671-680

  Valenzuela, Christine L ^a   Wang, Pearl Y ^b  

^a Department of Computer Science ^*  (United Kingdom)

^b George Mason University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); INTEGRATED CIRCUIT DESIGN; SIGNAL ENCODING; VLSI CIRCUITS;

ENCODING SCHEMES; FLOORPLANS; GENETIC OPERATORS; MODULE SETS; POSTFIX EXPRESSIONS; RUNTIMES; SLICING TREE; VLSI FLOORPLANNING;

GENETIC ALGORITHMS;

EID: 23044522437     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45356-3_66     Document Type: Conference Paper

References (15)

1. D.J. Cavicchio. Adaptive search using simulated evolution. Unpublished doctorial dissertation, University of Michigan, Ann Arbor, 1970.
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.
3. J.H. Holland. Adaptation in natural and artificial systems. Ann Arbor: The University of Michigan Press, 1975.
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.
5. S Nakatake, H. Murata, K. Fujiyoushi Y Kajitani. Rectangle-packing-based module placement, Proceedings IEEE International Conference on Computer-Aided Design, pages 143-145, 1995.
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.
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.
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.
9. L. Stockmeyer. Optimal Orientations of Cells in Slicing Floorplan Design, Information and Control, Vol. 59, pages 91-101, 1983.
10. G. Syswerda. Uniform Crossover in Genetic Algorithms, Proceedings of the Third International Conference on Genetic Algorithms. Hillsdale, NJ: Lawrence Erlbaum Associates, 1989.
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).
12. D.F. Wong and H.W. Leong and C.L Liu. Simulated Annealing for VLSI Design, Kluwer Academic Publishers, Norwell, Massachusetts, 1988.
13. F.Y. Young and D.F. Wong. How Good are Slicing Floorplans, The VLSI Journal, Vol. 23, pages 61-73, 1997.
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.
15. F.Y. Young and D.F. Wong. Slicing floorplans with boundary constraints. IEEE Asia South Pacific Design Automation, pages 17-20, 1999.