{'fraction_non_alphanumeric': 0.014268727705112961, 'fraction_numerical': 0.0, 'mean_word_length': 5.736, '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}}
Optimal and Heuristic Code Generation for Explicitly Parallel Processors

We describe our ongoing research within the EPICOpt project aimed at optimal and near-optimal code generation for explicitly parallel processors. On the one hand, this includes the application of techniques from the operations research domain to decrease the solver time for integer linear programming formulations of code generation problems. On the other hand, we want to investigate when and why established heuristics fail, and to develop efficient approximation algorithms and near-optimal techniques that remain computationally feasible even for large problems. To aid our investigation of the performance of various approaches to code generation, we are also investigating novel ways of efficient processor simulation using just-in-time compilation techniques.