A new simultaneous circuit partitioning and chip placement approach based on simulated annealing
暂无分享,去创建一个
[1] Richard I. Hartley,et al. Behavioral to structural translation in a bit-serial silicon compiler , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[2] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.
[3] Peter F. Corbett,et al. A digit-serial silicon compiler , 1988, DAC '88.
[4] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[5] D. F. Wong,et al. Simulated Annealing for VLSI Design , 1988 .
[6] L. J. Bock,et al. Paper 2. , 1973, The Australian journal of physiotherapy.
[7] Balakrishnan Krishnamurthy,et al. An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.
[8] Carl Sechen,et al. VLSI Placement and Global Routing Using Simulated Annealing , 1988 .
[9] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[10] Peter F. Corbett,et al. A digital-serial silicon compiler , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..
[11] Brian Kernighan,et al. An efficient heuristic for partitioning graphs , 1970 .
[12] HE Ixtroductiont,et al. The Bell System Technical Journal , 2022 .