Generating synthetic benchmark circuits for evaluating CAD tools

For the development and evaluation of computer-aided design tools for partitioning, floorplanning, placement, and routing of digital circuits, a huge amount of benchmark circuits with suitable characteristic parameters is required. Observing the lack of industrial benchmark circuits available for use in evaluation tools, one could consider to actually generate synthetic circuits. In this paper, we extend a graph-based benchmark generation method to include functional information. The use of a user-specified component library, together with the restriction that no combinational loops are introduced, now broadens the scope to timing-driven and logic optimizer applications. Experiments show that the resemblance between the characteristic Rent curve and the net degree distribution of real versus synthetic benchmark circuits is hardly influenced by the suggested extensions and that the resulting circuits are more realistic than before. An indirect validation verifies that existing partitioning programs have comparable behavior for both real and synthetic circuits. The problems of accounting for timing-aware characteristics in synthetic benchmarks are addressed in detail and suggestions for extensions are included.

[1]  Roy L. Russo,et al.  On a Pin Versus Block Relationship For Partitions of Logic Graphs , 1971, IEEE Transactions on Computers.

[2]  Vipin Kumar,et al.  Hmetis: a hypergraph partitioning package , 1998 .

[3]  Ieee Circuits,et al.  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems information for authors , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Jason Cong,et al.  FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Roy L. Russo On the Tradeoff Between Logic Performance and Circuit-to-Pin Ratio for LSI , 1972, IEEE Transactions on Computers.

[6]  J. Harlow,et al.  Synthesis of ESI Equivalence Class Combinational Circuit Mutants , 1997 .

[7]  Dirk Stroobandt,et al.  A Stochastic Model for Interconnection Complexity based on Rent's Rule. , 2000 .

[8]  J. P. Grossman,et al.  Characterization and parameterized generation of synthetic combinational benchmark circuits , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Joni Dambre,et al.  Optoelectronic FPGAs , 1999 .

[10]  Patrick H. Madden Partitioning by iterative deletion , 1999, ISPD '99.

[11]  Fadi J. Kurdahi,et al.  On the characterization of multi-point nets in electronic designs , 1998, Proceedings of the 8th Great Lakes Symposium on VLSI (Cat. No.98TB100222).

[12]  Jan M. Van Campenhout,et al.  A quantitative analysis of the benefits of the use of area-I/O pads in FPGAs , 1997, Microprocess. Microsystems.

[13]  Michel Minoux,et al.  Generation of very large circuits to benchmark the partitioning of FPGA , 1999, ISPD '99.

[14]  Kazuo Iwama,et al.  Random benchmark circuits with controlled attributes , 1997, Proceedings European Design and Test Conference. ED & TC 97.

[15]  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.

[16]  T. Ohtsuki,et al.  Recent advances in VLSI layout , 1990, Proc. IEEE.

[17]  Dirk Stroobandt,et al.  Towards an Extension of Rent's Rule for Describing Local Variations in Interconnection Complexity , 1995 .

[18]  Chung-Kuan Cheng,et al.  Ratio cut partitioning for hierarchical designs , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  Kazuo Iwama,et al.  Random Generation of Test Instances for Logic Optimizers , 1994, 31st Design Automation Conference.

[20]  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.

[21]  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).

[22]  Dirk Stroobandt,et al.  Estimating Interconnection Lengths in Three-Dimensional Computer Systems (Special Issue on Synthesis and Verification of Hardware Design) , 1996 .

[23]  Charles J. Alpert,et al.  The ISPD98 circuit benchmark suite , 1998, ISPD '98.

[24]  Jonathan Rose,et al.  Generation of synthetic sequential benchmark circuits , 1997, FPGA '97.

[25]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[26]  Jan M. Van Campenhout,et al.  Generating new benchmark designs using a multi-terminal net model , 1999, Integr..

[27]  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).

[28]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[29]  Nevin Kapur,et al.  Synthesis of wiring signature-invariant equivalence class circuit mutants and applications to benchmarking , 1998, Proceedings Design, Automation and Test in Europe.