Perturb+mutate: Semisynthetic circuit generation for incremental placement and routing

CAD tool designers are always searching for more benchmark circuits to stress their software. In this article we present a heuristic method to generate benchmark circuits specially suited for incremental place-and-route tools. The method removes part of a real circuit and replaces it with an altered version of the same circuit to mimic an incremental design change. The alteration consists of two steps: mutate followed by perturb. The perturb step exactly preserves as many circuit characteristics as possible. While perturbing, reproduction of interconnect locality, a characteristic that is difficult to measure reliably or reproduce exactly, is controlled using a new technique, ancestor depth control (ADC). Perturbing with ADC produces circuits with postrouting properties that match the best techniques known to-date. The mutate step produces targetted mutations resulting in controlled changes to specific circuit properties (while keeping other properties constant). We demonstrate one targetted mutation heuristic, scale, to significantly change circuit size with little change to other circuit characteristics. The method is simple enough for inclusion in a CAD tool directly, and fast enough for use in on-the-fly benchmark generation.

[1]  Guy Lemieux,et al.  Logic block clustering of large designs for channel-width constrained FPGAs , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[2]  Jan M. Van Campenhout,et al.  Generating synthetic benchmark circuits for evaluating CAD tools , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Jason Cong,et al.  Incremental physical design , 2000, ISPD '00.

[4]  Guy Lemieux,et al.  Semi-Synthetic Circuit Generation Using Graph Monomorphism for Testing Incremental Placement and Incremental Routing Tools , 2006, 2006 International Conference on Field Programmable Logic and Applications.

[5]  Stephen Dean Brown,et al.  Incremental retiming for FPGA physical synthesis , 2005, Proceedings. 42nd Design Automation Conference, 2005..

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

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

[8]  Vaughn Betz,et al.  Architecture and CAD for Deep-Submicron FPGAS , 1999, The Springer International Series in Engineering and Computer Science.

[9]  Vaughn Betz,et al.  Speed and area tradeoffs in cluster-based FPGA architectures , 2000, IEEE Trans. Very Large Scale Integr. Syst..

[10]  Stephen D. Brown,et al.  Incremental placement for layout-driven optimizations on FPGAs , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

[11]  Jason Cong,et al.  Incremental CAD , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

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

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

[14]  Jonathan Rose,et al.  Synthetic circuit generation using clustering and iteration , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[15]  Guy Lemieux,et al.  Perturber: semi-synthetic circuit generation using ancestor control for testing incremental place and route , 2006, 2006 IEEE International Conference on Field Programmable Technology.

[16]  Jonathan Rose,et al.  Automatic generation of synthetic sequential benchmark circuits , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

[19]  Stephen Dean Brown,et al.  Integrated retiming and placement for field programmable gate arrays , 2002, FPGA '02.