{'fraction_non_alphanumeric': 0.01768990634755463, 'fraction_numerical': 0.003121748178980229, 'mean_word_length': 5.127388535031847, '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}}
Making a Better Use of Caches for GCN Accelerators with Feature Slicing and Automatic Tile Morphing

GCNs (Graph Convolutional Networks) are becoming increasingly popular in the field of neural networks due to their ability to analyze many kinds of irregular data. Along with the rapid growth, there are various accelerators being proposed to mitigate the huge computational requirements. Often, the key bottleneck of executing GCNs is at the random accesses posed on the wide feature array. Vertex tiling is a popular technique to address the issue, but has a drawback of putting too much repetition on the data and being hard to tune parameters. In such regard, we propose feature slicing and automatic tile morphing, which greatly improves the cache behavior, and allows for easier tuning. Experimental results show that the proposed methods provide up to 40.1 percent overall execution time reduction, and automatically finds near-optimal tuning parameters.