A Genetic Approach to Standard Cell Placement Using Meta-Genetic Parameter Optimization

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 9, Issue 5, 1990, Pages 500-511

  Shahookar, Khushro ^a   Mazumder, Pinakl ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ENGINEERING--TECHNOLOGY TRANSFER; INTEGRATED CIRCUITS--COMPUTER AIDED DESIGN; MATHEMATICAL TECHNIQUES--OPERATORS; OPTIMIZATION; PROBABILITY;

CROSSOVER OPERATORS; GENETIC ALGORITHM; INVERSION OPERATORS; META-GENETIC PARAMETER OPTIMIZATION; MUTATION OPERATORS; STANDARD CELL PLACEMENT;

INTEGRATED CIRCUITS, VLSI;

EID: 0025430950     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.55180     Document Type: Article

References (24)

1. M. A. Breuer “Min-cut placement” J. Design Automat. Fault Tolerant Comput., vol. 1, pp. 343–382, Oct. 1977.
2. H. Chang and P. Mazumder “Bit-map crossover based genetic algorithm for macro-cell placement” Tech. Rep., CRL-TR-10-89, Dep. Elect. Eng. Comput. Sci., Univ. of Michigan, 1989.
3. C. Cheng and E. Kuh “Module placement based on resistive network optimization,” IEEE Trans. Computer-Aided Design, vol. CAD-3, pp. 218–225, July 1984.
4. J. P. Cohoon, W. D. Paris “Genie technical report,” Dep. Comput. Sci., Univ. of Virginia, 1986.
5. F. Darema, S. Kirkpatrick, and V. A. Norton “Parallel techniques for chip placement by simulated annealing on shared memory systems,” in Proc. IEEE Int. Conf. on Computer Design, pp. 87–90, 1987.
6. L. Davis “Job shop scheduling with genetic algorithms,” in Proc. Int. Conf. on Genetic Algorithms and Their Applications, pp. 136–140, 1985.
7. — “Applying adaptive algorithms to epistatic domains,” in Proc. Int. Joint Conf. on Artificial Intelligence, 1985.
8. A. E. Dunlop and B. W. Kernighan “A procedure for placement of standard-cell VLSI circuits,” IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 92–98, Jan. 1985.
9. A. C. Englander “Machine learning of visual recognition using genetic algorithms,” in Proc. Int. Conf. on Genetic Algorithms and Their Applications, pp. 197–201, 1985.
10. D. E. Goldberg and R. Lingle “Alleles, loci, and the traveling salesman problem,” in Proc. Int. Conf. on Genetic Algorithms and Their Applications, 1985.
11. S. Goto “An efficient algorithm for the two-dimensional placement problem in electrical circuit layout,” IEEE Trans. Circuits Syst., vol. CAS-28, pp. 12–18, Jan. 1981.
12. J. J. Grefenstette, R. Gopal, B. Rosmaita, and D. Van Gucht “Genetic algorithms for the traveling salesman problem,” in Proc. Int. Conf. on Genetic Algorithms and Their Applications, pp. 160–168, 1985.
13. J. J. Grefenstette “Optimization of control parameters for genetic algorithms,” IEEE Trans. Systems, Man, Cybernet., vol. SMC-16, Jan./Feb. 1986.
14. J. H. Holland Adaptation in Natural and Artificial Systems. Ann Arbor, MI: University of Michigan, 1972.
15. M. Jones and P. Bannerjee “Performance of a parallel algorithm for standard cell placement on the Intel hypercube,” in Proc. Design Automation Conf., 1987.
16. S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi “Optimization by simulated annealing,” Sci., vol. 220, no. 4598, pp. 671–680, May 13, 1983.
17. R. M. Kling “Placement by simulated evolution,” M.S. thesis. Coordinated Science Lab, College of Engr., Univ. of Illinois at Urbana-Champaign, June 1987.
18. S. A. Kravitz and R. A. Rutenbar “Placement by simulated annealing on a multiprocessor,” IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 534–549, June 1987.
19. S. Nahar, S. Sahni and E. Shragowitz “Experiments with simulated annealing,” in Proc. 22nd Design Automation Conf, pp. 748–752, 1985.
20. I. M. Oliver, D. J. Smith, and J. R. C. Holland “A study of permutation crossover operators on the traveling salesman problem,” in Proc. Int. Conf. on Genetic Algorithms and Their Applications, pp. 224–230, 1985.
21. C. Sechen and A. Sangiovanni-Vincentelli “The TimberWolf placement and routing package,” IEEE J. Solid-State Circuits, vol. SC-20, pp. 510–522, Apr. 1985.
22. I. Stadnyk “Schema recombination in pattern recognition problems,” in Proc. Int. Conf. on Genetic Algorithms and Their Applications, pp, 27–35, 1987.
23. P. Suaris and G. Kedem “Quadrisection: A new approach to standard cell layout,” in Proc. IEEE Int. Conf. on Computer-Aided Design, pp. 474–477, 1987.
24. S. W. Wilson “Adaptive ‘cortical’ pattern recognition,” in Proc. Int. Conf. on Genetic Algorithms and Their Applications, pp. 188–196, 1985.