PartGen: A generator of very large circuits to benchmark the partitioning of FPGAs

Citation
J. Pistorius et al., PartGen: A generator of very large circuits to benchmark the partitioning of FPGAs, IEEE COMP A, 19(11), 2000, pp. 1314-1321
Citations number
16
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
ISSN journal
02780070 → ACNP
Volume
19
Issue
11
Year of publication
2000
Pages
1314 - 1321
Database
ISI
SICI code
0278-0070(200011)19:11<1314:PAGOVL>2.0.ZU;2-T
Abstract
This paper describes a new procedure for generating very large realistic be nchmark 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 conf igurable logic blocks (500K equivalent gates), for instance, takes only 2 m in on a standard UNIX workstation. The analysis of a large number of netlis ts 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. Th erefore, 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 th e generated netlists behave similarly to the originals in terms of average filling rate and average pin utilization.