{'fraction_non_alphanumeric': 0.02043010752688172, 'fraction_numerical': 0.007526881720430108, 'mean_word_length': 5.896296296296296, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Netlist partitioning for FPGA-based run-time reconfiguration

This paper demonstrates the feasibility of using automated netlist partitioning to improve the performance of a single FPGA run-time reconfigurable system. Run-time reconfiguration (RTR), an important model for computing, can outperform other computing solutions for some applications and exhibit high architectural flexibility. The performance of RTR is heavily influenced by circuit partitioning. While partitioning procedures to enhance RTR have been previously explored, their nature remains poorly understood. A partitioning system has, therefore, been designed and implemented in software to interface functional circuits to an industry standard graph partitioning heuristic and to study its performance. Experimental results demonstrate that a 103 gate, low-power DCT implementation with 105 nets may be bipartitioned with an interpartition bandwidth of 3 nets.