Equivalence classes of clone circuits for physical-design benchmarking

To provide a better understanding of physical design algorithms and the underlying circuit architecture they are targeting, we need to exercise the algorithms and architectures with many benchmark circuits. The lack of existing benchmarks makes us consider the automatic generation of netlists. In this paper, we formally define the equivalence class of circuit "clones" of a given seed circuits, based upon physical properties of the seed circuit's netlist graph. Using these equivalence classes of circuits, a given seed circuit can be used to generate many similar circuits. A more finely grained statistical analysis of algorithm behaviour can then be obtained from using the multiple benchmarks than would be available from using the seed benchmark alone.

[1]  Jonathan Rose,et al.  Applications of clone circuits to issues in physical-design , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

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

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

[4]  Jonathan Rose,et al.  Characterization and parameterized random generation of digital circuits , 1996, DAC '96.

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

[6]  Rolf Drechsler,et al.  Design of experiments in CAD: context and new data sets for ISCAS'99 , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

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

[8]  William E. Donath,et al.  Placement and average interconnection lengths of computer logic , 1979 .

[9]  Franc Brglez,et al.  Design of Experiments for Evaluation of BDD Packages Using Controlled Circuit Mutations , 1998, FMCAD.

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

[11]  Nevin Kapur,et al.  Towards a new benchmarking paradigm in EDA: analysis of equivalence class mutant circuit distributions , 1997, ISPD '97.

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

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