{'fraction_non_alphanumeric': 0.016775396085740912, 'fraction_numerical': 0.0, 'mean_word_length': 5.509090909090909, '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}}
Generating structured program instances with a high degree of locality

Memory hierarchy-consciousness is an important requirement for the design of high-performance programs. We describe a tool that supports the programmer in restructuring performance-critical code sections. The tool works with small program instances, which are obtained by fixing program parameters such as loop bounds, and rewriting the program as an operation sequence. The tool automatically reorders the operations for better locality, and respects data dependencies. It outputs the optimized program instance in a structured form. The user finally recognizes the localityrelevant structure and generalizes it to the program. The paper focuses on recent advances in the development of our method. In particular, we introduce a hierarchical clustering scheme that highlights operation subsequences with much data reuse. The scheme is applied to the generation of structured optimized program instances in which the locality-relevant structure is easy to recognize. Experimental results are included.