Name
Abstract | ||
|---|---|---|
This paper describes a new procedure for generating very large realistic benchmark circuits which are especially suited for the performance evaluation of field-programmable gate array partitioning algorithms. These benchmark circuits can be generated quickly. The generation of a netlist of 100K configurable logic blocks (500K equivalent gates), for instance, takes only 2 min on a standard UNIX workstation. The analysis of a large number of netlists from real designs lead us to identify the following five different kinds of subblocks: Regular combinational logic, irregular combinational logic, combinational and sequential logic, memory blocks, and interconnections. Therefore, our generator integrates a subgenerator for each of these types of netlist, The comparison of the partitioning results of industrial netlists with those obtained from generated netlists of the same size shows that the generated netlists behave similarly to the originals in terms of average filling rate and average pin utilization. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/43.892855 | IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS |
Keywords | DocType | Volume |
benchmarking, partitioning, random circuit generation | Journal | 19 |
Issue | ISSN | Citations |
11 | 0278-0070 | 2 |
PageRank | References | Authors |
0.42 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joachim Pistorius | 1 | 24 | 1.92 |
| Edmée Legai | 2 | 7 | 0.93 |
| Michel Minoux | 3 | 741 | 100.18 |