Genetic vlsi circuit partitioning with two-dimensional geographic crossover and zigzag mapping

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 1997, Pages 274-278

  Moon, Buyng Ro ^a   Lee, Yoon Sik ^a   Kim, Chun Kyung ^a  

^a Hynix Semiconductor Inc   (South Korea)

Author keywords

Circuit partitioning; Equivalence class; Genetic algorithm; Geographic crossover; Geographical linkage

Indexed keywords

ALGORITHMS; EQUIVALENCE CLASSES; VLSI CIRCUITS;

BENCHMARK CIRCUIT; CIRCUIT PARTITIONING; DIVERSE SOLUTIONS; GEOGRAPHIC CROSSOVER; GEOGRAPHICAL LINKAGE; NEW GENETIC ALGORITHMS; PARTITIONING PROBLEM; STATE-OF-THE-ART APPROACH;

GENETIC ALGORITHMS;

EID: 27144538369     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/331697.331754     Document Type: Conference Paper

References (19)

1. J. Bagley. The Behavior of Adaptive Systems Which Employ Genetic and Correlation Algorithms. PhD thesis. University of Micttigan, Ann Arbor, MI. 1967.
2. T. N. Bui and B. R. Moon. Hyperplane synthesis for genetic algorithms. In Fifth International Con ference on Genetic Algorithms, pages 102-109, July 1993.
3. T. N. Bui and B. IR. Moon. Analyzing hyperplano synthesis in genetic algorithms using clustered schemata. In International Conference on Evolutionary Computation. 278 Oct. 1994. Lecture Notea in Computer Science, 866:108- 118, Springer-Verlag.
4. T. N. Bui and B. R. Moon. A fast and stable hybrid genetic Mgorithm for the ratio-cut partitioning problem on hypergraphs. In 31st ACM/IBEE Design Automation Conference, pages 664-669, June 1994.
5. T. N. Bui and B. R. Moon. Graph partitioning and genetic Mgorithms. IEEE Trans. on Computers, 45(7):841- 855, 1996.
6. P. Chan, P. Mazumder, arid K. Shahookar. Macro-cell mad module placement by genetic adaptive search with bitmap-represented chromosome. Integration, 12(1):49- 77, 1991.
7. L. Davis. Handbook of Genetic Algorithma. Van Nostrand Reinhold, NY, 1991.
8. W. Donath and A. Hoffman. Algorithms for partitioning of graphs and computer logic based on eigenvectors of connected matrices. IBM Technical diJciosure Bulletin, 15:938-944, 1972.
9. C. Fiduccia and R. Mattheyses. A linear time heuristics for improving network partitions. In 19th ACM/IEEE Design Automation Conference, pages 175-181, 1982.
10. L. Hagen and A. B. Kahng. New spectral methods for ratio cut partitioning and clustering. IEEE Trans. on Computer-Aided Design, 11(9):297-314, 1992.
11. J. Holland. Adaptation in Natural and Artificial Systems, 2nd ed. MIT Press, 1992.
12. A. B. Kahng and B. It. Moon. Toward more powerful recombinations. In Sixth International Conference on genetic Algorithms. pages 96-103, 1995.
13. N. Linlal, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. In Foundations of Computer Science, pages 577-591, 1994.
14. B. R. Moon. A hybrid genetic search for standard-cell circuit placement problem, ongoing.
15. N. Radcliffe. Equivalence class analysis of genetic algorithms. Complex Systems, 5:183-205, 1991.
16. W. Sun and C. Sechen. Efficient and effective placement for very large circuits. IEEE Trans. on Computer-Aided Design. 14(3):349-359, 1995.
17. G. Syswerda. Uniform crossover in genetic algorithms. In Third International Conference on Genetic Algorithms, pages 2-9, 1989.
18. Y. Wei and C.K. Cheng. Itatio cut partitioning for hierarchical designs. IEEE Trans. on Computer-Aided Design, 10(7):911-921. 1991.
19. D. Whitley and J. Kauth. Genitor: A different genetic algorithm. In Rocky Mountain Conference on Artificial Intelligence. pages 118-130.