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

被引:7
|
作者
Pistorius, J [1 ]
Legai, E
Minoux, M
机构
[1] Lattice Semicond Corp, San Jose, CA 95134 USA
[2] Mentor Graph Corp, F-91975 Courtaboeuf, France
[3] Univ Paris 06, Comp Sci Lab, F-75252 Paris 05, France
关键词
benchmarking; partitioning; random circuit generation;
D O I
10.1109/43.892855
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1314 / 1321
页数:8
相关论文
共 50 条
  • [1] Generation of very large circuits to benchmark the partitioning of FPGAs
    Pistorius, Joachim
    Legai, Edmee
    Minoux, Michel
    Proceedings of the International Symposium on Physical Design, 1999, : 67 - 73
  • [2] Partitioning sequential circuits on dynamically reconfigurable FPGAs
    Chang, D
    Marek-Sadowska, M
    IEEE TRANSACTIONS ON COMPUTERS, 1999, 48 (06) : 565 - 578
  • [3] Research on the impact of different benchmark circuits on the representative path in FPGAs
    Xu, Jiqing
    Li, Zhengjie
    Pang, Yunbing
    Wang, Jian
    Qu, Gang
    Lai, Jinmei
    2019 IEEE 13TH INTERNATIONAL CONFERENCE ON ASIC (ASICON), 2019,
  • [4] Cost minimization of partitioning circuits with complex resource constraints in FPGAs
    Lin, YC
    Tseng, SF
    Hung, YS
    Hsieh, TM
    2000 IEEE ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS: ELECTRONIC COMMUNICATION SYSTEMS, 2000, : 556 - 559
  • [5] Parallel synthesis of large combinational circuits for FPGAs
    Lemarchand, L
    HIGH-PERFORMANCE COMPUTING AND NETWORKING, 1997, 1225 : 1042 - 1043
  • [6] SIGNAL DRIVEN PARTITIONING LARGE CIRCUITS
    Bucur, Ion
    Cupcea, Nicolae
    Stefanescu, Costin
    Popescu, Cornel
    Surpateanu, Adrian
    Bolangiu, Costin-Anton
    ANNALS OF DAAAM FOR 2009 & PROCEEDINGS OF THE 20TH INTERNATIONAL DAAAM SYMPOSIUM, 2009, 20 : 1121 - 1122
  • [7] Median filtering with very large windows: SKA algorithms for FPGAs
    Sherwin, Tyrone
    Wang, Kevin I-Kai
    Thiagaraj, Prabu
    Sinnen, Oliver
    2018 28TH INTERNATIONAL CONFERENCE ON FIELD PROGRAMMABLE LOGIC AND APPLICATIONS (FPL), 2018, : 196 - 201
  • [8] Efficient Automated Implementation of Testable Cellular Automata Based Pseudorandom Generator Circuits on FPGAs
    Palchaudhuri, Ayan
    Amresh, Amrit Anand
    Dhar, Anindya Sundar
    JOURNAL OF CELLULAR AUTOMATA, 2017, 12 (3-4) : 217 - 247
  • [9] EFFICIENT AND EFFECTIVE PLACEMENT FOR VERY LARGE CIRCUITS
    SUN, WJ
    SECHEN, C
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1995, 14 (03) : 349 - 359
  • [10] Metallography of very large scale integrated circuits
    Metallographie an hochintegrierten Schaltkreisen
    Burger, K., 1990, (27):