Synthetic Benchmark Circuits for Timing-driven Physical Design Applications.

For the development and evaluation of new algorithms, architectures and technologies, a huge amount of benchmark circuits with suitable characteristic parameters are required. Synthetic circuits are a viable alternative to real circuits for compiling benchmark suites. A major advantage of synthetic benchmark circuits is that full control of the important parameters is provided. In this paper, an existing netlist generation algorithm based on bottom-up clustering of subcircuits according to Rent’s rule is extended to generate circuits that are more realistic than before. The stochastic properties of the Rent behavior are taken into account, and improvements have been made to increase the accuracy of the imposed Rent characteristics. This guarantees a realistic structure of the interconnection topology, which can be adjusted in a controlled manner. A scheme for combinational loop prevention has been augmented with a delay control mechanism, such that they are truly suitable for timing-driven applications. An indirect validation approach is used to verify that existing placement algorithms exhibit comparable behavior for both real and synthetic

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

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

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

[4]  李幼升,et al.  Ph , 1989 .

[5]  Andrew B. Kahng,et al.  Partitioning with terminals: a “new” problem and new benchmarks , 1999, ISPD '99.

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

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

[8]  Balakrishnan Krishnamurthy,et al.  Constructing Test Cases for Partitioning Heuristics , 1987, IEEE Transactions on Computers.

[9]  Jan M. Van Campenhout,et al.  A stochastic model for the interconnection topology of digital circuits , 2001, IEEE Trans. Very Large Scale Integr. Syst..

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

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