Dynamic embedding for genetic VLSI circuit partitioning

Engineering Applications of Artificial Intelligence

Volumn 11, Issue 1, 1998, Pages 67-76

  Moon, Byung Ro ^b   Kim, Chun Kyung ^a  

^a Hynix Semiconductor Inc   (South Korea)

^b Seoul National University   (South Korea)

Author keywords

Encoding; Genetic algorithm; VLSI circuit partitioning

Indexed keywords

ARTIFICIAL INTELLIGENCE; ENCODING (SYMBOLS); INTEGRATED CIRCUIT LAYOUT; PROBLEM SOLVING; VLSI CIRCUITS;

CIRCUIT-PARTITIONING PROBLEM;

GENETIC ALGORITHMS;

EID: 0031995914     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0952-1976(98)80005-5     Document Type: Article

References (23)

1. Anderson, C.A., Jones, K.F., Ryan, J., 1991. A two-dimensional genetic algorithm for the Ising Problem. Complex Systems 5, 327-333.
2. Bagley, J., 1967. The Behavior of Adaptive Systems Which Employ Genetic and Correlation Algorithms. Ph.D. thesis, University of Michigan, Ann Arbor, MI.
3. Bui, T.N. and Moon, B.R., 1993. Hyperplane Synthesis for Genetic Algorithms. In Fifth International Conference on Genetic Algorithms, pp. 102-109.
4. Bui, T.N. and Moon, B.R., 1994a. A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on hypergraphs. In 31st ACM/IEEE Design Automation Conference, pp. 664-669.
5. Bui, T.N. and Moon, B.R., 1994b. A New Genetic Approach for the Traveling Salesman Problem. In IEEE Conference on Evolutionary Computation, pp. 7-12.
6. Bui, T.N. and Moon, B.R., 1995. On Multi-Dimensional Encoding/ Crossover. In Sixth International Conference on Genetic Algorithms, pp. 49-56.
7. Bui, T.N., Moon, B.R., 1996. Genetic algorithm and graph partitioning. IEEE Trans, on Computers 45 (7), 841-855.
8. Chan, P., Mazumder, P., Shahookar, K., 1991. Macro-cell and module placement by genetic adaptive search with bitmap-represented chromosome. Integration 12 (1), 49-77.
9. Cohoon, J.P. and Paris, W., 1986. Genetic Placement. In IEEE International Conference on Computer-Aided Design, pp. 422-425.
10. Cormen, T., Leiserson, C. and Rivest, R., 1989. Introductions to Algorithms. McGraw-Hill.
11. DeJong, K., Spears, W., 1992. A Formal Analysis of the role of multipoint crossover in genetic algorithms. Annals of Math. AI Journal 5, 1-26.
12. Donath, W., Hoffman, A., 1972. Algorithms for partitioning of graphs and computer logic based on eigenvectors of connected matrices. IBM Technical disclosure Bulletin 15, 938-944.
13. Forrest, S., Mitchell, M., 1993. What makes a genetic algorithm hard? Some anomalous results and their explanation. Machine Learning 13 (2-3), 285-319.
14. Goldberg, D., 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley.
15. Hagen, L., Kahng, A.B., 1992. New spectral methods for ratio cut partitioning and clustering. IEEE Trans, on Computer-Aided Design 11 (9), 297-314.
16. Holland, J., 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press.
17. Kahng, A.B. and Moon, B.R., 1995. Toward More Powerful Recombinations. In Sixth International Conference on genetic Algorithms, pp. 96-103.
18. Moon, B.R., Lee, Y.S. and Kim, C.K., 1997. Genetic VLSI Circuit Partitioning with Two-Dimensional Geographic Crossover and Zigzag Mapping. In 12th Annual ACM Symposium on Applied Computing, pp. 274-278.
19. Oliver, I., Smith, D. and Holland, J., 1987. A Study of Permutation Crossover Operators on the Traveling Salesman Problem. In Second International Conference on Genetic Algorithms, pp. 224-230.
20. Fiduccia and Mattheyses, 1982. A Linear Time Heuristic for Improving Network Partitions. In 19th ACM/IEEE Design Automation Conference, pp. 175-181.
21. Syswerda, G., 1989. Uniform Crossover in Genetic Algorithms. In Third International Conference on Genetic Algorithms, pp. 2-9.
22. Wei, Y., Cheng, C., 1991. Ratio cut partitioning for hierarchical designs. IEEE Trans, on Computer-Aided Design 10 (7), 911-921.
23. Whitley, D. and Kauth, J., 1988. Genitor: A Different Genetic Algorithm. In Rocky Mountain Conference on Artificial Intelligence, pp. 118-130.