{'fraction_non_alphanumeric': 0.024935511607910577, 'fraction_numerical': 0.0034393809114359416, 'mean_word_length': 4.762376237623762, '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}}
A Comparison of DAG and Mesh Topologies for Coarse-Grain Reconfigurable Array

In this paper, we address the hardware overhead of the dynamically reconfigurable functional unit (DRFU) in dynamically reconfigurable processors (DRP), in the context of low-power, embedded system-on-chips (E-SoC). We consider a tightly coupled DRP with a small, coarse-grain DRFU made of four columns of four ALUs. These are interconnected following one of the following interconnection scheme: direct acyclic graph or mesh. Given a large set of of custom instructions to map on the DRFU, we explore the simplification opportunities on the DRFU in order to reduce its hardware cost. We determine that it is possible to reduce its footprint by about 70 % with respect to the ALUs for both topologies and 50 % with respect to the interconnection between ALUs. We also provide the place and route algorithm to achieve these results. At the end of the paper we compare both topologies with respect to the hardware usage, the opportunities for simplifications and the complexity of the place and route algorithm. We conclude that the mesh topology is in all the cases the most desirable.