A Circuit Partition Algorithm Basing on Probability Gain

Kernighan B W and Lin S. An efficient heuristic procedure for partitioning graphs [J]. Bell System Tech. Journal, 1970, 49: 291-307.[2]Cong J, Labio W, and Shivakumar N. Multi-way VLSI circuit partitioning based on dual net representation [J].IEEE Trans on Computer-Aided Design of Integrated Circuits and Systems.1996, 15:396-409[3]Karypis G and Kumar V. Parallel multilevel k-way partitioning scheme for irregular graphs [A]. Proceedings of the 1996 ACM/IEEE Conference on Supercomputing, Pennsylvania, CA, 1996: 35-42.[4]Saab Youssef G. An effective multilevel algorithm for bisecting graphs and hypergraphs [J]. IEEE Transactions on Computers, 2004, 53: 641-652.[5]Wei Y C and Cheng C K. Towards efficient hierarchical designs by ratio cut partitioning [A]. IEEE/ACM International Conference on Computer Aided Design, Santa Clara, CA, 1989: 298-301.[6]Chan P, Schlag M, and Zien J. Spectral k-way ratio-cut partitioning and clustering [J].IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.1994, 13:1088-1096[7]Fiduccia C M and Mattheyses R M. A linear time heuristic for improving network partitions [A]. Proceedings of the 19th Conference on Design Automation, Piscataway, CA, 1982: 175-181.[8]Alpert C J and Kahng A B. A general framework for vertex ordering with application to netlist clustering [J].IEEE Transactions on Very Large Scale Integration Systems.1996, 4:240-246[9]Dutt D and Deng W. VLSI circuit partitioning by cluster-removal using iterative improvement techniques [A]. IEEE/ACM International Conference on Computer-Aided Design, San Jose, CA, 1996: 194-200.[10]Eem C K and Chong J W. An efficient iterative improvement technique for VLSI circuit partitioning using hybrid bucket structures [A]. Proceedings of the ASP-DAC '99 on Design Automation Conference, Wanchai, HK, 1999, 1: 73-76.[11]Hagen L W, Huang D J H, and Kahng A B. On implementation choices for iterative improvement partitioning algorithms[A]. Proceedings of the Conference on European Design Automation, Brighton, UK, 1995: 144-149.[12]Alpert Arles J and Kahng Andrew B. Recent directions in netlist partitioning [J].Integration the VLSI Journal.1995, 19:1-81[13]Krishnamurthy B. An improved min-cut algorithm for partitioning VLSI networks [J].IEEE Trans. on Computer.1984, C-33:438-446[14]Schweikert D G and Kernighan B W. A proper model for the partitioning of electrical circuits[A]. Proceedings of the 9th Workshop on Design Automation, New York, CA, 1972: 57-62.