论文信息 - Circuit Bipartitioning Using Genetic Algorithm

Circuit Bipartitioning Using Genetic Algorithm

In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic which is a modification of Fiduccia-Matheses algorithm. Using well-known benchmarks (including ACM/SIGDA benchmarks), the combination of genetic algorithm and the local heuristic outperformed hMetis [3], a representative circuit partitioning algorithm.

Byung Ro Moon | Jong-Pil Kim

[1] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[2] Charles M. Fiduccia,et al. A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[3] Shashi Shekhar,et al. Multilevel hypergraph partitioning: application in VLSI domain , 1997, DAC.

[4] Yong-Hyuk Kim,et al. A Hybrid Genetic Approach for Circuit Bipartitioning , 2002, GECCO.

[5] Yong-Hyuk Kim,et al. A Hybrid Genetic Search for Graph Partitioning Based on Lock Gain , 2000, GECCO.