Cluster-aware iterative improvement techniques for partitioning large VLSI circuits
暂无分享,去创建一个
[1] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[2] Brian W. Kernighan,et al. A proper model for the partitioning of electrical circuits , 1972, DAC '72.
[3] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.
[4] Balakrishnan Krishnamurthy,et al. An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.
[5] Chung-Kuan Cheng,et al. Towards efficient hierarchical designs by ratio cut partitioning , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[6] Andrew B. Kahng,et al. Fast spectral methods for ratio cut partitioning and clustering , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.
[7] Chung-Kuan Cheng,et al. An improved two-way partitioning algorithm with stable performance [VLSI] , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[8] Andrew B. Kahng,et al. New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[9] Krzysztof Kozminski,et al. Cost Minimization of Partitions into Multiple Devices , 1993, 30th ACM/IEEE Design Automation Conference.
[10] Malgorzata Marek-Sadowska. Issues in Timing Driven Layout , 1993, Algorithmic Aspects of VLSI Layout.
[11] Konrad Doll,et al. Partitioning Very Large Circuits Using Analytical Placement Techniques , 1994, 31st Design Automation Conference.
[12] A general framework for vertex orderings, with applications to netlist clustering , 1994, ICCAD '94.
[13] Gaetano Borriello,et al. An evaluation of bipartitioning techniques , 1995, Proceedings Sixteenth Conference on Advanced Research in VLSI.
[14] Chung-Kuan Cheng,et al. Linear decomposition algorithm for VLSI design applications , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).
[15] Youssef Saab,et al. A Fast and Robust Network Bisection Algorithm , 1995, IEEE Trans. Computers.
[16] Charles J. Alpert,et al. Spectral Partitioning: The More Eigenvectors, The Better , 1995, 32nd Design Automation Conference.
[17] Chung-Kuan Cheng,et al. Linear decomposition algorithm for VLSI design applications , 1995, International Conference on Computer Aided Design.
[18] Shantanu Dutt,et al. VLSI circuit partitioning by cluster-removal using iterative improvement techniques , 1996, ICCAD 1996.
[19] Andrew B. Kahng,et al. A hybrid multilevel/genetic approach for circuit partitioning , 1996, Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems.
[20] Shantanu Dutt,et al. A probability-based approach to VLSI circuit partitioning , 1996, DAC '96.
[21] S. Dutt,et al. VLSI circuit partitioning by cluster-removal using iterative improvement techniques , 1996, Proceedings of International Conference on Computer Aided Design.
[22] Shantanu Dutt,et al. Partitioning around roadblocks: tackling constraints with intermediate relaxations , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).
[23] Jason Cong,et al. Large scale circuit partitioning with loose/stable net removal and signal flow based clustering , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).
[24] S. Dutt,et al. Partitioning around roadblocks: tackling constraints with intermediate relaxations , 1997, ICCAD 1997.
[25] Andrew B. Kahng,et al. Multilevel circuit partitioning , 1997, DAC.
[26] Shashi Shekhar,et al. Multilevel hypergraph partitioning: application in VLSI domain , 1997, DAC.
[27] Andrew B. Kahng,et al. Multilevel circuit partitioning , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..