A Stochastic Model for Interconnection Complexity based on Rent's Rule.
暂无分享,去创建一个
[1] W. Donath. Wire length distribution for placements of computer logic , 1981 .
[2] Roy L. Russo. On the Tradeoff Between Logic Performance and Circuit-to-Pin Ratio for LSI , 1972, IEEE Transactions on Computers.
[3] Dirk Stroobandt,et al. Towards an Extension of Rent's Rule for Describing Local Variations in Interconnection Complexity , 1995 .
[4] Vipin Kumar,et al. Hmetis: a hypergraph partitioning package , 1998 .
[5] Fadi J. Kurdahi,et al. On the intrinsic rent parameter and spectra-based partitioning methodologies , 1992, EURO-DAC '92.
[6] D. Stroobannt. PIN count prediction in ratio cut partitioning for VLSI and ULSI , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).
[7] Dirk Stroobandt. On an efficient method for estimating the interconnection complexity of designs and on the existence of region III in Rent's rule , 1999, Proceedings Ninth Great Lakes Symposium on VLSI.
[8] P. Christie,et al. A fractal analysis of interconnection complexity , 1993, Proc. IEEE.
[9] Jan M. Van Campenhout,et al. Generating synthetic benchmark circuits for evaluating CAD tools , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[10] Peter Verplaetse. On the relationship between Rent's rule and Pareto points , 2000 .
[11] James D. Meindl,et al. A stochastic wire length distribution for gigascale integration (GSI) , 1997, Proceedings of CICC 97 - Custom Integrated Circuits Conference.
[12] Roy L. Russo,et al. On a Pin Versus Block Relationship For Partitions of Logic Graphs , 1971, IEEE Transactions on Computers.