Effective memetic algorithms for VLSI design = genetic algorithms + local search + multi-level clustering

Evolutionary Computation

Volumn 12, Issue 3, 2004, Pages 327-353

  Areibi, Shawki ^a   Yang, Zhen ^a  

^a UNIVERSITY OF GUELPH   (Canada)

Author keywords

Circuit Placement; Genetic Algorithms; Local Search; Memetic Algorithms; Multi Level Clustering; Netlist Partitioning

Indexed keywords

CIRCUIT PLACEMENT; LOCAL SEARCH; MEMETIC ALGORITHMS (MA); MULTI-LEVEL CLUSTERING; NETLIST PARTITIONING;

AUTOMATION; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; HIERARCHICAL SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

VLSI CIRCUITS;

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; COMPUTER AIDED DESIGN; COMPUTER SIMULATION; MATHEMATICAL COMPUTING; SEMICONDUCTOR; STATISTICAL MODEL;

ALGORITHMS; COMPUTER SIMULATION; COMPUTER-AIDED DESIGN; MATHEMATICAL COMPUTING; MODELS, GENETIC; MODELS, STATISTICAL; SEMICONDUCTORS;

EID: 4544226146     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/1063656041774947     Document Type: Article

References (24)

1. Areibi, S. (2000). An Integrated Genetic Algorithm With Dynamic Hill Climbing for VLSI Circuit Partitioning. In GECCO 2000, pages 97-102, Las Vegas, Nevada. IEEE.
2. Areibi, S., Moussa, M., and Abdullah, H. (June 2001a). A Comparison of Genetic/Memetic Algorithms and Other Heuristic Search Techniques. In International Conference on Artificial Intelligence, pages 660-666, Las Vegas, Nevada.
3. Areibi, S., Thompson, M., and Vannelli, A. (September 2001b). A Clustering Utility Based Approach for ASIC Design. In 14th Annual IEEE International ASIC/SOC Conference, pages 248-252, Washington, DC. IEEE, ACM.
4. Areibi, S. and Vannelli, A. (1996). An Efficient Clustering Technique for Circuit Partitioning. In IEEE ISCAS, pages 671-674, San Diego, California.
5. Dutt, S. and Deng, W. (1996). VLSI Circuit Partitioning by Cluster-Removal Using Iterative Improvement Techniques. In IEEE International Conference on CAD, pages 194-200. ACM/IEEE.
6. Dutt, S. and Theny, H. (November 1997). Partitioning Around Roadblocks: Tackling Constraints with Intermediate Relaxations. In IEEE International Conference on CAD, pages 350-355.
7. Feo, T., Resende, M., and Smith, S. (1994). A Greedy Randomized Adaptive Search Procedure for The Maximum Ind ependent Set. Operations Research,42:860:878.
8. Fiduccia, C. and Mattheyses, R. (June 1982). A Linear-Time Heuristic for Improving Network Partitions. In Proceedings of 19th DAC, pages 175-181, Las Vegas, Nevada. ACM/IEEE.
9. Garey, M. and Johnson, D. (1979). Computers and Intractability. Freeman, San Francisco CA.
10. Goldberg, D. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Company, Inc, Reading, Massachusetts.
11. Hagen, L. and Kahng, A. (1992). A New Approach to Effective Circuit Clustering. In IEEE International Conference on CAD, pages 422-427.
12. Kang, S.-M. and Leblebici, Y. (2003). CMOS Digital Integrated Circuits. McGraw-Hill Publishing Company, Inc.
13. Karger, P. and Preas, B. (1986). Automatic Placement: A Review of Current Techniques. In Proceedings of the 23rd DAC, pages 622-629, Las Vegas, Nevada. IEEE/ACM.
14. Karypis, G., Aggarwal, R., Kumar, V., and Shekhar, S. (June 1997). Multilevel Hypergraph Partioning: Application in VLSI Design. In Proceedings of the 35th DAC, pages 526-529, Las Vegas, Nevada. ACM/IEEE.
15. Kernighan, B. and Lin, S. (February 1970). An Efficient Heuristic Procedure for Partitioning Graphs. The Bell System Technical Journal, 49(2):291-307.
16. Mallela, S. and Grover, L. (1989). Clustering Based Simulated Annealing for Standard Cell Placement. In Proceedings of The 26th DAC, pages 312-317, Las Vegas, Nevada. IEEE/ACM.
17. Michalewicz, Z. (1992). Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlog, Berlin, Heidelberg.
18. Rabaey, J., Chandrakasan, A., and Nikolic, B. (2003). DIGITAL INTEGRATED CIRCUITS. Pearson Education Publishing Company, Inc.
19. Riess, B., Doll, K., and Johannes, F. (1994). Partitioning very large circuits using analytical placement techniques. In Proceedings of 31st DAC, pages 646-651, Las Vegas, Nevada. ACM/IEEE.
20. Roberts, K. and Preas, B. (1987). Physical Design Workshop 1987. Technical report, MCNC, Marriott's Hilton Head Resort,South Carolina.
21. Sanchis, L. (January 1989). Multiple-Way Network Partitioning. IEEE Transactions on Computers, 38(1):62-81.
22. Sechen, C. and Chen, D. (1988). An improved Objective Function for Min-Cut Circuit Partitioning. In Proceedings of ICCAD, pages 502-505, San Jose, California.
23. Shahookar, K. and Mazumder, P. (1991). VLSI Cell Placement Techniques. ACM Computing Surveys, 23(2):143-220.
24. Yang, Z. and Areibi, S. (2002). Global Placement Techniques for VLSI Physical Design Automation. In 15th International Conference on Computer Applications in Industry and Engineering, pages 243-247, San Diego, California. ISCA.