{'fraction_non_alphanumeric': 0.03343782654127482, 'fraction_numerical': 0.01044932079414838, 'mean_word_length': 5.517006802721088, '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}}
An Effective Routability-Driven Packing Algorithm for Large-Scale Heterogeneous FPGAs

As the increasing complexity and scale of FPGA architecture grows, heterogeneity and routability have greatly challenged FPGA placement. In this paper, we propose an effective routability-driven packing algorithm for large-scale heterogeneous FPGAs. First, we present a novel BLE packing method to deal with the complex clock constraints, meanwhile forming more HCLB-friendly BLEs. Then, we propose a congestion-aware HCLB packing technique to produce placement-friendly netlists without degrading routability. Finally, we adopt an effective and accurate method to perform routing congestion estimation to guide the packing algorithm. Based on the ISPD 2017 benchmarks, experimental results show that our algorithm achieves the best overall routed wirelength and outperforms three state-of-the-art FPGA placers by 9.8%, 8.2%, and 3.4% on routed wirelength, respectively.