|
References [CBL] Computer-Aided Design Benchmarking Laboratory. URL: http://www.cbl.ncsu.edu/benchmarks/ [Alp98] C. J. Alpert, “The ISPD98 Circuit Benchmark suite,” in Proc. ACM/SIGDA Int. Symp. Physical Design, Apr. 1998, pp. 85-90. URL: http://vlsicad.cs.ucla.edu/~cheese/ispd98.html/ [Iwa94] K. Iwama and K. Hino, “Random Generation of Test Instances for Logic Optimizers,” in Proc. ACM/IEEE Design Automation Conf., June 1994, pp. 430-434. [Iwa97] K. Iwama, K.Hino, H. Kurokawa, and S. Sawada, “Random Benchmark Circuits with Controlled Attributes,” in Proc. Eur. Design Test Conf., 1997. [Hut97a] Michael D. Hutton, “Characterization and Parameterized Generation of Digital Circuits”, Ph D. Thesis, Graduate Department of Computer Science, University Of Toronto, 1997. [Hut97b] M. Hutton, J. Rose, and D.Corneil, “Generation of Synthetic Sequential Benchmark Circuits,” in Proc. ACM/SIGDA Int. Symp. FPGA, Feb 1997, pp. 149-155. [Kap98] D. Ghosh, N. Kapur, J. Harlow III, and F. Brglez, “Synthesis of Wiring Signature-Invariant Equivalent Class Circuit Mutants and Applications to Benchmarking,” in Proc. Design, Automation, and Test in Eur. Conf., Feb. 1998, pp. 656-663. [Dar96] J. Darnauer and W. W. Dai, “A Method for Generating Random Circuits and Its Application to routability measurement,” in Proc. ACM/SIGDA Int. Symp. FPGA, Feb. 1996, pp. 66-72. [Hut98] M. D. Hutton, J. Rose, J. P. Grossman, and D. Corneil, “Characterization and Parameterized Generation of Synthetic Combinational Circuits,” IEEE Trans. Computer-Aided Design, vol. 17, Oct. 1998, pp. 985-996. [Che98] Jiunn-Ren Chen, “Genrtation of Wire-Load Models for Logic Synthesis”, Master Thesis, Graduate Institute of Electrical Engineering and Computer Engineering and Science, Yuan-Ze University, Taiwan, R.O.C., 1998. [Str00] D. Stroobandt, P. Verplaetse, and J. Van Campenhout, “Generating Synthetic Benchmark Circuits for Evaluating CAD Tools,” IEEE Trans. Computer-Aided Design, vol. 19, Sept. 2000, pp. 1011-1022. [Pis99] J. Pistorius, E. Legai, and M. Minoux, “Generation of Very Large Circuits to Benchmark the Partitioning of FPGAs,” in Proc. ACM/SIGDA Int. Symp. Physical Design, April 1999, pp.67-73. [Lan71] B. S. Landman and R. L. Russo, “On a Pin Versus Block Relationship for Partitions of Logic Graphs,” IEEE Trans. Computers, vol. C-20, no. 12, Dec. 1971, pp. 1469-1479. [Rus72] R. L. Russo, “On the Tradeoff Between Logic Performance and Circuit-to-Pin Ratio for LSI,” IEEE Trans. Computers, vol. C-21, no 2, pp. 147-153, Feb. 1972. [Hag94] L. Hagen, A. B. Kahng, F. J. Kurdahi, and C. Ramachandran, “On the Intrinsic Rent Parameter and Spectra-Based Partitioning Methodologies,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 13, Jan. 1994, pp. 27-37. [Tet95a] A. Y. Tetelbaum, ”Generalizations of Rent’s Rule,” in Proc Southeastern Symp. System Theory, March 1995, pp. 370-374. [Tet95b] A. Y. Tetelbaum, “Estimations of Layout Parameters of Hierarchical Syztems,” Proc. Of the 27th SouthEastern Symp. On System Theory, pp. 353-357, 1995. [Cal98] A. E. Caldwell, A. B. Kahng, and I. L. Markov, ”Relax Partitioning Balance Constraints in Top-Down Placement,” 17th ASIC Conference, 1998, pp. 229-232. [Chr00] P. Christie, ”Rent exponent prediction methods,” IEEE Trans. Very Large Scale Integration Systems, vol. 8, Dec. 2000, pp. 679-688. [Don79] W. E. Donath, “Placement and Average Interconnection Lengths of Computer Logic,” IEEE Trans. On Circuits and Systems, vol. CAS-26, no. 4, pp. 272-277, April 1979. [Don81] W. E. Donath, “Wire Length Distribution for Placements of Computer logic,” IBM J. Res. Develop., vol. 25, no. 3, pp. 152-155 May 1981. [Feu82] M. Feuer, “Connectivity of Random Logic,” IEEE Trans. On Computers, vol. C-31, no. 1,pp. 29-33, Jan. 1982. [Gur89] C. V. Gura and J. A. Abraham, “Average Interconnection Length and Interconnection Distribution Based on Rent’s Rule,” 26th ACM/IEEE Design Automation Conf., pp. 574-577, 1989. [Hel78] W. R. Heller, W. F. Mikhail;, and W. E. Donath, “Prediction of Wiring Space Requirements for LSI,” J. of Design Automation and Fault-Tolerant Computing, vol. 2, pp. 117-144, May 1978. [Sas86] S. Sastry and A. C. Parker, “Stochastic Models for Wirability Analysis of Gate Arrays,” IEEE Trans. On Computer-Aided Design, vol. CAD-5, no. 1, pp.52-65, Jan 1986. [Sch82] D. C. Schmidt, “Circuit Pack Parameter Estimation Using Rent’s,” IEEE Trans. On Computer-Aided Design of Intergrated Circuits and Systems, vol. CAD-1, no. 4, pp. 186-192, 1982. [Str99] D. Stroobandt, “On an Efficient Method for Estimating the Interconnection Complexity of Designs and on the Existence if Region III in Rent’s Rule,” VLSI, Lakes Symp., 1999, pp. 330-331. [Ver01] P. Verplaetse, “Refinements of Rent’s Rule Allowing Accurate Interconnect Complexity Modeling,” Quality Eletronic Design, International Symp., 2001 pp. 251-252. [Kar97] G. Karypis, R. Aggarwal, V. Kumar and S. Shekhar, “Multilevel Hypergraph Partitioning: Application in VLSI Domain”, 34th IEEE/ACM Design Automation Conference, 1997, pp. 526-529.
|