Synthetic Benchmark Circuits for Timing-driven Physical Design Applications.
暂无分享,去创建一个
[1] Dirk Stroobandt,et al. A Stochastic Model for Interconnection Complexity based on Rent's Rule. , 2000 .
[2] Roy L. Russo,et al. On a Pin Versus Block Relationship For Partitions of Logic Graphs , 1971, IEEE Transactions on Computers.
[3] Jan M. Van Campenhout,et al. Generating synthetic benchmark circuits for evaluating CAD tools , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[5] Andrew B. Kahng,et al. Partitioning with terminals: a “new” problem and new benchmarks , 1999, ISPD '99.
[6] Wayne Wei-Ming Dai,et al. A Method for Generation Random Circuits and Its Application to Routability Measurement , 1996, Fourth International ACM Symposium on Field-Programmable Gate Arrays.
[7] Jan M. Van Campenhout,et al. On synthetic benchmark generation methods , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).
[8] Balakrishnan Krishnamurthy,et al. Constructing Test Cases for Partitioning Heuristics , 1987, IEEE Transactions on Computers.
[9] Jan M. Van Campenhout,et al. A stochastic model for the interconnection topology of digital circuits , 2001, IEEE Trans. Very Large Scale Integr. Syst..
[10] Vipin Kumar,et al. Hmetis: a hypergraph partitioning package , 1998 .
[11] Charles J. Alpert,et al. The ISPD98 circuit benchmark suite , 1998, ISPD '98.