Multi-way VLSI Circuit Partitioning Based On Dual Net Representation
暂无分享,去创建一个
[1] Konrad Doll,et al. Partitioning Very Large Circuits Using Analytical Placement Techniques , 1994, 31st Design Automation Conference.
[2] Ravi B. Boppana,et al. Eigenvalues and graph bisection: An average-case analysis , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[3] A. Hoffman,et al. Lower bounds for the partitioning of graphs , 1973 .
[4] Jason Cong,et al. Random walks for circuit clustering , 1991, [1991] Proceedings Fourth Annual IEEE International ASIC Conference and Exhibit.
[5] J. Hwang,et al. Optimal replication for min-cut partitioning , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.
[6] Balakrishnan Krishnamurthy,et al. An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.
[7] Andrew B. Kahng,et al. New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[8] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.
[9] Jason Cong,et al. A Parallel Bottom-up Clustering Algorithm with Applications to Circuit Partitioning in VLSI Design , 1993, 30th ACM/IEEE Design Automation Conference.
[10] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[11] Andrew B. Kahng,et al. Geometric Embeddings for Faster and Better Multi-Way Netlist Partitioning , 1993, 30th ACM/IEEE Design Automation Conference.
[12] D. F. Wong,et al. Efficient network flow based min-cut balanced partitioning , 1994, ICCAD 1994.
[13] Laura A. Sanchis,et al. Multiple-Way Network Partitioning , 1989, IEEE Trans. Computers.
[14] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[15] Jason Cong,et al. On area/depth trade-off in LUT-based FPGA technology mapping , 1994, IEEE Trans. Very Large Scale Integr. Syst..
[16] Jason Cong,et al. Acyclic Multi-Way Partitioning of Boolean Networks , 1994, 31st Design Automation Conference.
[17] Jason Cong,et al. Net partitions yield better module partitions , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.
[18] E. Barnes. An algorithm for partitioning the nodes of a graph , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.
[19] Kenneth J. Supowit,et al. Simulated Annealing Without Rejected Moves , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[20] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[21] A. Kahng,et al. A new approach to effective circuit clustering , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.
[22] Ernest S. Kuh,et al. Performance-driven system partitioning on multi-chip modules , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.
[23] Martine D. F. Schlag,et al. Spectral K-way ratio-cut partitioning and clustering , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[24] C. Yeh,et al. A probabilistic multicommodity-flow solution to circuit clustering problems , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.
[25] Chingwei Yeh,et al. A general purpose multiple way partitioning algorithm , 1991, DAC '91.